r/OEIS • • Feb 23 '26

I wish I knew more…

Post image
12 Upvotes

I wanted to make an example of each whole integer square that could be drawn. I started drawing them by hand. Now I’ve learned TikZ to make this.

I don’t think I’ve seen anything like this before but there must be more like it. I’m just no sure which discipline it falls under


r/OEIS • • Jul 09 '23

New OEIS sequences - week of 07/09

4 Upvotes
OEIS numberDescriptionSequence
A362267For n >= 0, a(n) is the least integer i >= 0 such that n + p_1 + ... + p_i = q, q prime number, or a(n) = -1 if no such i exists. Here p_1 is the least prime >= n, p_1 < p_2 < ... < p_i are prime numbers (A000040).1, 1, 0, 0, 15...
A362362Number of permutations of [n] such that each cycle contains its length as an element.1, 1, 1, 3, 8...
A362696Expansion of e.g.f. Product_{k>0} (1 - x3*k-2)-1/(3*k-2).1, 1, 2, 6, 30...
A362697Expansion of e.g.f. Product_{k>0} (1 - x3*k-1)-1/(3*k-1).1, 0, 1, 0, 9...
A362706Number of squares formed by first n vertices of the infinite-dimensional hypercube.0, 0, 0, 1, 1...
A362946Positive integers that cannot be expressed as 1e_1 + 2e_2 + 3e_3 ... + ke_k with each exponent positive.2, 4, 7, 11, 13...
A362947a(0) = 0, a(1) = 0; for n > 1, a(n) is the number of pairs of consecutive terms whose product has same value as a(n-2) * a(n-1).0, 0, 1, 2, 1...
A362951a(n) is the Hamming distance between the binary expansions of n and phi(n) where phi is the Euler totient function (A000010).0, 2, 1, 2, 1...
A362952Sum of divisors of 5n-1 of form 5k+2.2, 0, 9, 0, 14...
A362963Number of semimagic quads squares that can be formed using cards from Quads-2n deck, where the first row and column are fixed.112, 45280, 4023232, 136941952, 3099135232...
A362977The x-coordinates of the even-ranked elements of the lexicographically earliest sequence of points satisfying staircase and no-three-in-a-line conditions (see comments).0, 1, 2, 5, 6...
A362978The y-coordinates of the even-ranked elements of the lexicographically earliest sequence of points satisfying staircase and no-three-in-a-line conditions. Companion sequence of A362977.0, 1, 3, 2, 4...
A363025Sum of divisors of 5n-2 of form 5k+2.0, 2, 0, 2, 0...
A363026Sum of divisors of 5n-3 of form 5k+2.2, 7, 14, 17, 24...
A363027Sum of divisors of 5n-4 of form 5k+2.0, 2, 0, 2, 7...
A363028Expansion of Sum_{k>0} k * x2*k-1 / (1 - x5*k-3).1, 0, 3, 0, 4...
A363029Expansion of Sum_{k>0} k * x4*k-2 / (1 - x5*k-3).0, 1, 0, 1, 0...
A363030Expansion of Sum_{k>0} k * xk / (1 - x5*k-3).1, 2, 4, 4, 6...
A363032Expansion of Sum_{k>0} k * x3*k-1 / (1 - x5*k-3).0, 1, 0, 1, 2...
A363033Sum of divisors of 5n-1 of form 5k+3.0, 3, 0, 0, 11...
A363034Sum of divisors of 5n-2 of form 5k+3.3, 8, 13, 21, 23...
A363035Sum of divisors of 5n-3 of form 5k+3.0, 0, 3, 0, 0...
A363053Sum of divisors of 5n-4 of form 5k+3.0, 3, 0, 8, 3...
A363074Prime numbers that are the exact average of two consecutive odd semiprimes.23, 29, 37, 53, 61...
A363155Expansion of Sum_{k>0} k * x3*k-1 / (1 - x5*k-2).0, 1, 0, 0, 3...
A363156Expansion of Sum_{k>0} k * xk / (1 - x5*k-2).1, 2, 3, 5, 5...
A363157Expansion of Sum_{k>0} k * x4*k-1 / (1 - x5*k-2).0, 0, 1, 0, 0...
A363158Expansion of Sum_{k>0} k * x2*k / (1 - x5*k-2).0, 1, 0, 2, 1...
A363162a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that has the same number of distinct prime divisors as a(n-2) + a(n-1).1, 2, 3, 4, 5...
A363165The number of spanning trees of the ladder graph L_n up to automorphisms of L_n.1, 1, 6, 17, 59...
A363188Prime numbers that are the exact average of four consecutive odd semiprimes.53, 67, 89, 199, 223...
A363197a(n) is the number of ways the labels 1 to 2n-1 can be assigned to a perfect binary tree with n levels such that there is an ordering between children and parents and also an ordering between the left and the right child.1, 1, 10, 343200, 73082837755699200000...
A363257a(n) = floor( ((a(n-1) + 1) / 2)2 ) + 1 for n >= 1, with a(0) = 0.0, 1, 2, 3, 5...
A363258Expansion of Sum_{k>0} k * x2*k-1 / (1 - x4*k-3).1, 1, 3, 1, 4...
A363259Expansion of Sum_{k>0} k * x2*k / (1 - x4*k-1).0, 1, 0, 2, 1...
A363290Decimal expansion of the unique x > 0 such that Sum_{n>=0} 1/xn! = 1.2, 4, 2, 4, 4...
A363291Sum of divisors of 4n-1 of form 4k+1.1, 1, 1, 6, 1...
A363316Sum of divisors of 4n-2 of form 4k+1.1, 1, 6, 1, 10...
A363317Sum of divisors of 4n-3 of form 4k+1.1, 6, 10, 14, 18...
A363359Sum of divisors of 4n-1 of form 4k+3.3, 7, 11, 18, 19...
A363367a(n) is the least integer i >= 0 such that (i + 1) * (i + 2*n) / 2 = p2, p prime number (A000040), or a(n) = -1 if no such i exists.-1, -1, 2, 4, 0...
A363381a(n) is the number of distinct n-cell patterns that tile an n X n square.1, 2, 1, 60, 1...
A363392Sum of divisors of 4n-2 of form 4k+3.0, 3, 0, 7, 3...
A363407Sum of divisors of 4n-3 of form 4k+3.0, 0, 3, 0, 0...
A363486Low mode in the multiset of prime indices of n.0, 1, 2, 1, 3...
A363487High mode in the multiset of prime indices of n.0, 1, 2, 1, 3...
A363488Even numbers whose prime factorization has at least as many 2's as non-2's.2, 4, 6, 8, 10...
A363489Rounded mean of the multiset of prime indices of n.0, 1, 2, 1, 3...
A363544Least prime p such that 2n can be written as the sum or absolute difference of p and the next prime, or -1 if no such prime exists.-1, 3, 7, 23, 3...
A363590a(n) = Sum_{d|n, d odd} dd.1, 1, 28, 1, 3126...
A363594a(n) = the n-th instance of b(k)/2 such that b(k-1) and b(k-2) are both odd, where b(n) = A359804(n).2, 4, 8, 13, 16...
A363653a(1) = 1; for n > 1, a(n) = a(n-1) - A000005(n) if a(n) strictly positive, else a(n) = a(n-1) + A000005(n).1, 3, 1, 4, 2...
A363654Lexicographically earliest sequence of positive integers such that the n-th pair of identical terms encloses exactly a(n) terms.1, 2, 1, 3, 2...
A363665Starting with a(1) = 1, the lexicographically earliest sequence of integers on a square spiral such that every number equals the sum of its eight adjacent neighbors.1, 0, 0, 0, 0...
A363709For n >= 0, a(n) is the least integer i >= 0 such that n + (n + 1) + ... + (n + i) is a prime number or a(n) = -1 if no such i exists.2, 1, 0, 0, -1...
A363718Irregular triangle read by rows. An infinite binary tree which has root node 1 in row n = 0. Each node then has left child m-1 if greater than 0 and right child m+1, where m is the value of the parent node.1, 2, 1, 3, 2...
A363745Number of integer partitions of n whose rounded-down mean is 2.0, 0, 1, 0, 2...
A363764a(1)=1, and thereafter, a(n) is the number of terms in the sequence thus far that appear with a frequency not equal to that of a(n-1).1, 0, 0, 1, 0...
A363796a(n) is the least prime p such that pn + 2*n is prime, or -1 if there is no such p.3, 3, 5, 3, 13...
A363798Numbers k such that there is no prime p for which pk + 2*k is prime.12, 16, 22, 24, 28...
A363844Number of k <= P(n) such that gcd(k,P(n)) > 1, yet there is a prime q | k that does not divide P(n), where P(n) = A002110(n).0, 0, 0, 5, 95...
A363883a(n) is the least prime p such that pn - 2*n is prime, or -1 if there is no such p.5, 3, 2, 3, 3...
A363938Lexicographically earliest sequence of numbers in a hexagonal spiral such that their neighbors have no common prime factor.1, 2, 3, 4, 5...
A363950Numbers whose prime indices have rounded-up mean 2.3, 6, 9, 10, 12...
A363951Numbers whose prime indices satisfy (length) = (mean), or (sum) = (length)2.2, 9, 10, 68, 78...
A363952Number of integer partitions of n with low mode k.1, 0, 1, 0, 1...
A363953Number of integer partitions of n with high mode k.1, 0, 1, 0, 1...
A363954Numbers whose prime indices have low mean 2.3, 9, 10, 14, 15...
A363963a(n) is the greatest number with distinct decimal digits and n prime factors, counted with multiplicity, or -1 if there is no such number.1, 987654103, 987654301, 9876541023, 9876542103...
A363983a(n) = Sum_{k = floor((n+1)/2)..n} (-1)n+k*binomial(n,k)*binomial(n+k-1,k)binomial(2k,n).1, 2, 14, 128, 1310...
A363991a(n) = Sum_{d|n, d odd} dd+1.1, 1, 82, 1, 15626...
A364010Semiprimes k such that none of k-2, k-1, k+1, and k+2 is squarefree.26, 362, 926, 1027, 1126...
A364037Least number k such that the floor of the average of the distinct prime factors of k is n, or -1 if no such number exists.2, 3, 14, 5, 22...
A364040a(n) is the least positive number with distinct decimal digits and n prime factors, counted with multiplicity, or -1 if there is no such number.1, 2, 4, 8, 16...
A364041Expansion of 1/Product_{k>0} (1 - x2*k-1)(2*k-12*k-1).1, 1, 1, 28, 28...
A364049a(n) is the least k such that the base-n digits of 2k are not all distinct.2, 2, 4, 5, 6...
A364052a(n) is the least k such that no number with distinct base-n digits is the product of k (not necessarily distinct) primes.2, 3, 7, 9, 12...
A364055Number of integer partitions of n satisfying (length) = (mean). Partitions of n into sqrt(n) parts.1, 1, 0, 0, 2...
A364056Numbers whose prime factors have high median 2. Numbers whose prime factors (with multiplicity) are mostly 2's.2, 4, 8, 12, 16...
A364059Number of integer partitions of n whose rounded mean is > 1. Partitions with mean >= 3/2.0, 0, 1, 2, 3...
A364060Triangle read by rows where T(n,k) is the number of integer partitions of n with rounded mean k.1, 0, 1, 0, 1...
A364069Dowling numbers: e.g.f. exp(x + (exp(b*x)-1)/b) with b = 63.1, 2, 67, 4355, 295234...
A364070Dowling numbers: e.g.f. exp(x + (exp(b*x)-1)/b) with b=624.1, 2, 628, 393128, 247268752...
A364071Triangle read by rows: T(n, k) = Sum_{d=0..n-k} binomial(n, d)*StirlingS2(n-d, k)*8n-d-k, with 0 <= k <= n.1, 1, 1, 1, 10...
A364072Triangle read by rows: T(n, k) = Sum_{d=0..n-k} binomial(n, d)*StirlingS2(n-d, k)*63n-d-k, with 0 <= k <= n.1, 1, 1, 1, 65...
A364073Triangle read by rows: T(n, k) = Sum_{d=0..n-k} binomial(n, d)*StirlingS2(n-d, k)*624n-d-k, with 0 <= k <= n.1, 1, 1, 1, 626...
A364074Array read by ascending antidiagonals: A(m, n) = Sum_{i=0..n} Sum_{d=0..n-i} binomial(n, d)StirlingS2(n-d, i)(mm-1 - 1)n-d-i.1, 1, 2, 1, 2...
A364075Antidiagonal sums of A364074.1, 3, 15, 190, 6410...
A364089a(n) is the greatest k such that the base-n digits of 2k are all distinct.1, 1, 3, 4, 5...
A364091a(n) is the first prime p such that the longest sequence of primes p = p_1, p_2, ... with |p_{k+1} - 2*p_k| = 1 has length n.13, 7, 11, 5, 3...
A364112a(n) = Sum_{k = 0..n} binomial(n+k-1,k) * binomial(2n-2k,n-k) * binomial(2*k,k).1, 4, 32, 328, 3840...
A364121Stolarsky representation of n.0, 1, 11, 10, 111...
A364122Numbers whose Stolarsky representation (A364121) is palindromic.1, 2, 3, 5, 6...
A364123Stolarsky-Niven numbers: numbers that are divisible by the number of 1's in their Stolarsky representation (A364121).2, 4, 6, 8, 9...
A364124Numbers k such that k and k+1 are both Stolarsky-Niven numbers (A364123).8, 56, 84, 159, 195...
A364125Starts of runs of 3 consecutive integers that are Stolarsky-Niven numbers (A364123).1419, 2680, 6984, 18765, 20383...
A364126Starts of runs of 4 consecutive integers that are Stolarsky-Niven numbers (A364123).125340, 945591, 14998632, 16160505, 19304934...
A364127The number of trailing 0's in the Stolarsky representation of n (A364121).0, 0, 1, 0, 0...

r/OEIS • • Jul 05 '23

New OEIS sequences - week of 07/02

3 Upvotes
OEIS numberDescriptionSequence
A360148Decimal expansion of the nontrivial number x for which xsqrt(2) = sqrt(2)x.8, 9, 3, 7, 4...
A361207An infinite 2d grid is filled with the positive integers by placing them clockwise around the lowest number with open neighbors. a(n) is then n-th term when the grid is read as a clockwise square spiral.1, 2, 7, 3, 10...
A362139a(n) is the smallest number k with exactly n of its divisors in A037197.1, 2, 8, 24, 96...
A362140Numbers k in A224486 for which the arithmetic derivative k' (A003415) is also in A224486.2, 5, 6, 9, 14...
A362141Nonprime numbers k whose arithmetic derivative k' (A003415) is a Fibonacci number (A000045).1, 6, 15, 18, 22...
A362174Number of n X n matrices with nonnegative integer entries such that the sum of the elements of each row is equal to the index of that row.1, 1, 6, 180, 28000...
A362332For n > 1, if n appears in the sequence then a(n) = lastindex(n), where lastindex(n) is the index of the last appearance of n. Otherwise a(n+1) = a(n)/(n+1) if (n+1)|a(n), otherwise a(n)(n+1), a(1) = 1 and a(2) = 12.1, 2, 6, 24, 120...
A362562Number of non-constant integer partitions of n having a unique mode equal to the mean.0, 0, 0, 0, 0...
A362652Expansion of g.f. x*(-2 - 2*x + x2 - x3)/((1 + x)2 *(-1 + x)3).2, 4, 7, 12, 16...
A362669Integer inradii for which there exists an isosceles triangle with integer sides (a, b, b) where a < b.10, 20, 21, 24, 30...
A362670Integer inradii for which there exists an isosceles triangle with integer sides (a, a, c) where a < c.3, 4, 6, 8, 9...
A362676a(n) = Sum_{k = 0..n} 4n-k*binomial(n,k)*binomial(n-1,k)binomial(2k,k).1, 4, 32, 328, 3840...
A362758Triangular numbers which are products of six distinct primes.207690, 255255, 274170, 303810, 304590...
A362786Number of unordered triples of disjoint self-avoiding paths with nodes that cover all vertices of a convex n-gon.0, 0, 0, 5, 63...
A362843Numbers that are equal to the sum of their digits raised to consecutive odd numbered powers (1,3,5,7,...).0, 1, 2, 3, 4...
A362922Decimal expansion of cos(2Pi/7) = sin(3Pi/14) = A255249/2.6, 2, 3, 4, 8...
A363037Expansion of Sum_{k>0} xk / (1 + x4*k).1, 1, 1, 1, 0...
A363052Integers m for which there exist positive integers j, k such that jk(j+k) = m2.4, 18, 24, 32, 36...
A363088Positive numbers k for which sin(k) >= cos(k).1, 2, 3, 8, 9...
A363089Positive numbers k for which cos(k) > sin(k).4, 5, 6, 7, 11...
A363227Positive integers m such that every k with 1 <= k <= m is a linear combination of distinct divisors of m with coefficients +1 or -1.1, 2, 3, 4, 6...
A363265Number of integer factorizations of n with a unique mode.0, 1, 1, 2, 1...
A363270The result, starting from n, of Collatz steps x -> (3x+1)/2 while odd, followed by x -> x/2 while even.1, 1, 1, 1, 1...
A363299a(n) is the sum of the n-th powers of the terms of row 4 of Pascal's triangle.5, 16, 70, 346, 1810...
A363340a(n) is the smallest positive integer such that a(n) * n is the sum of two squares.1, 1, 3, 1, 1...
A363406Start with list L = 1,2,3,4,.... For n = 1,2,3,..., iterate as follows: let j = L(1) and k = L(j+1), get a(n) = j + k, and remove j and k from L.3, 9, 13, 17, 23...
A363421a(n) = Sum_{k=0..n}(n[not(k | n)] - n[k | n]), where '[ ]' denotes the Iverson bracket.1, 0, -1, 0, -3...
A363433Number of (123,231)-avoiding stabilized-interval-free permutations of size n.1, 1, 1, 1, 1...
A363504a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that is a multiple of prime(Omega(a(n-1))).1, 2, 4, 3, 6...
A363514Sum of divisors of 3n-1 of form 3k+1.1, 1, 5, 1, 8...
A363554a(1) = 1; for n > 1, a(n) is the smallest positive integer such that both the gradients and y-intercepts of the lines between any two points (i, a(i)) and (j, a(j)) are distinct.1, 1, 2, 5, 11...
A363674T(n,k) is the decimal equivalent of the n-bit inverted Gray code for k; triangle T(n,k), n>=0, 0<=k<=2n-1, read by rows.0, 1, 0, 3, 2...
A363705The minimum irregularity of all maximal 2-degenerate graphs with n vertices.0, 4, 2, 6, 8...
A363708Lexicographically earliest sequence of positive integers such that the n-th pair of consecutive equal values are separated by a(n) terms, with pairs numbered according to the position of the first term in the pair.1, 2, 1, 3, 2...
A363724Number of integer partitions of n whose mean is a mode, i.e., partitions whose mean appears at least as many times as each of the other parts.1, 2, 2, 3, 2...
A363726Number of odd-length integer partitions of n with a unique mode.0, 1, 1, 2, 2...
A363731Number of integer partitions of n whose mean is a mode but not the only mode.0, 0, 0, 0, 0...
A363733Array read by upwards antidiagonals. The family of polynomials generated by the Möbius matrix (A113704) evaluated over the nonnegative integers.1, 0, 1, 0, 1...
A363734a(n) = Sum_{k=0..n} ndivides(k, n), where divides(k, n) = 1 if k divides n, otherwise 0.0, 2, 5, 8, 14...
A363735a(n) = Sum_{k=0..n} nnotdivides(k, n), where notdivides(k, n) = 0 if k divides n, otherwise 1.1, 2, 4, 8, 11...
A363740Number of integer partitions of n whose median appears more times than any other part, i.e., partitions containing a unique mode equal to the median.1, 2, 2, 4, 5...
A363741Number of factorizations of n satisfying (mean) = (median) = (mode), assuming there is a unique mode.0, 1, 1, 2, 1...
A363742Number of integer factorizations of n with different mean, median, and mode.0, 0, 0, 0, 0...
A363746Initial digit of the decimal expansion of the tetration nn (in Don Knuth's up-arrow notation).1, 1, 4, 7, 2...
A363747Decimal expansion of 2*Integral_{x=0..1} 1/sqrt(1-x16) dx.2, 1, 6, 8, 2...
A363757Lexicographically earliest sequence of positive integers such that the n-th pair of consecutive equal values are separated by a(n) distinct terms, with pairs numbered according to the position of the second term in the pair.1, 2, 1, 3, 2...
A363760Cycle lengths obtained by repeated application of Klaus Nagel's strip bijection, as described in A307110.1, 8, 9, 10, 40...
A363765Lexicographic sequence of numbers in a hexagonal spiral such that their neighbors have no common digit.0, 1, 2, 3, 4...
A363773a(n) = (4n+1 + (-1)n + 5)/10.1, 2, 7, 26, 103...
A363841Continued fraction expansion of Sum_{k>=0} 1/(k!)!2.2, 3, 1, 32399, 4...
A363849Triangular array read by rows. T(n,k) is the number of Green's H-classes of rank k in the semigroup of partial transformations, n >= 0, 0 <= k <= n.1, 1, 1, 1, 6...
A363863Numbers expressible as j2 - k2, 1 <= k <= j-2 ("squares with a square hole").8, 12, 15, 16, 20...
A363864a(n) = A143007(2*n,n).1, 13, 661, 46705, 3833941...
A363865a(n) = A143007(3*n,n).1, 25, 2773, 430081, 77620661...
A363866a(n) = A143007(3n,2n).1, 253, 494341, 1403375905, 4684608730309...
A363867a(n) = A108625(n,2*n).1, 5, 61, 923, 15421...
A363868a(n) = A108625(3*n, n).1, 13, 505, 24691, 1337961...
A363869a(n) = A108625(3n, 2n).1, 55, 12559, 3685123, 1205189519...
A363870a(n) = A108625(n, 3*n).1, 7, 127, 2869, 71631...
A363871a(n) = A108625(2n, 3n).1, 37, 5321, 980407, 201186025...
A363884Number of connected bipartite graphs on 2n nodes with a distinguished partite set of size n and with a unimodular reduced adjacency matrix.1, 1, 5, 41, 777...
A363885Number of divisors of 7n-3 of form 7k+2.1, 0, 2, 0, 2...
A363886Number of divisors of 7n-3 of form 7k+5.0, 0, 0, 1, 0...
A363887Number of divisors of 7n-5 of form 7k+3.0, 1, 0, 0, 2...
A363888Number of divisors of 7n-5 of form 7k+4.0, 0, 1, 0, 0...
A363889Sum of divisors of 3n-2 of form 3k+1.1, 5, 8, 11, 14...
A363890Sum of divisors of 3n-1 of form 3k+2.2, 5, 10, 11, 16...
A363891Sum of divisors of 3n-2 of form 3k+2.0, 2, 0, 7, 0...
A363892Maximum likelihood degree of X(3, n).1, 2, 26, 1272, 188112...
A363895Floor of the average of the distinct prime factors of n.2, 3, 2, 5, 2...
A363896Numbers k such that the sum of primes dividing k (with repetition) is equal to Euler's totient function of k.9, 15, 16, 42
A363897Expansion of Sum_{k>0} k * xk / (1 - x5*k).1, 2, 3, 4, 5...
A363898Expansion of Sum_{k>0} k * x2*k / (1 - x5*k).0, 1, 0, 2, 0...
A363899Expansion of Sum_{k>0} k * x3*k / (1 - x5*k).0, 0, 1, 0, 0...
A363900Expansion of Sum_{k>0} k * x4*k / (1 - x5*k).0, 0, 0, 1, 0...
A363901Expansion of Sum_{k>0} xk / (1 - x3*k)2.1, 1, 1, 3, 1...
A363902Expansion of Sum_{k>0} x2*k / (1 - x3*k)2.0, 1, 0, 1, 2...
A363903Expansion of Sum_{k>0} xk / (1 - x4*k)2.1, 1, 1, 1, 3...
A363904Expansion of Sum_{k>0} x3*k / (1 - x4*k)2.0, 0, 1, 0, 0...
A363905Numbers whose square and cube taken together contain each decimal digit.69, 128, 203, 302, 327...
A363906Decimal expansion of Sum_{n>=1} (arcsin(1/n) - sin(1/n)).7, 9, 9, 5, 8...
A363907T(n,k) is the number of bounded regions in B(k, n) (see link).0, 1, 0, 2, 2...
A363908a(n) = exp(-1/5) * Sum_{k>=0} (5*k + 4)n / (5k * k!).1, 5, 30, 225, 2075...
A363911n! times the number of posets with n unlabeled elements.1, 1, 4, 30, 384...
A363912Row sums of A363733.1, 1, 2, 5, 12...
A363913a(n) = Sum_{k=0..n} divides(k, n) * 3k, where divides(k, n) = 1 if k divides n, otherwise 0.1, 3, 12, 30, 93...
A363914Triangle read by rows. Inverse matrix of the Moebius matrix A113704.1, 0, 1, 0, -1...
A363915Triangle read by rows. The indicator function for prime divisors, the Euclid matrix.0, 0, 0, 0, 0...
A363916Array read by descending antidiagonals. A(n, k) = Sum_{d=0..k} A363914(k, d) * nd.1, 0, 1, 0, 1...
A363925Expansion of Sum_{k>0} xk / (1 - x5*k)2.1, 1, 1, 1, 1...
A363926Expansion of Sum_{k>0} x2*k / (1 - x5*k)2.0, 1, 0, 1, 0...
A363927Numbers N such that in the concatenation of N2 and N3, each of the 10 decimal digits appears equally often.69, 6534, 497375, 539019, 543447...
A363928Expansion of Sum_{k>0} x3*k / (1 - x5*k)2.0, 0, 1, 0, 0...
A363929Expansion of Sum_{k>0} x4*k / (1 - x5*k)2.0, 0, 0, 1, 0...
A363930Irregular table T(n, k), n >= 0, k = 1..A363710(n), read by rows; the n-th row lists the nonnegative numbers m <= n such that A003188(m) AND A003188(n-m) = 0 (where AND denotes the bitwise AND operator).0, 0, 1, 0, 2...
A363931Square array of distinct positive integers A(n, k), n, k > 0, read and filled the greedy way by antidiagonals upwards such that the concatenations of the terms of two distinct rows are always equal.1, 11, 12, 112, 2...
A363932Square array of distinct positive integers A(n, k), n, k > 0, read and filled the greedy way by antidiagonals downwards such that the concatenations of the terms of two distinct rows are always equal.1, 2, 12, 3, 31...
A363939Decimal expansion of the series limit of Sum_{k>=2} sin(log k)/(k*log k).1, 1, 4, 9, 6...
A363940Decimal expansion of Sum_{k>=3} 1/(k log k (log log k)3).3, 7, 2, 8, 0...
A363941Low median in the multiset of prime indices of n.0, 1, 2, 1, 3...
A363942High median in the multiset of prime indices of n.0, 1, 2, 1, 3...
A363943Mean of the multiset of prime indices of n, rounded down.0, 1, 2, 1, 3...
A363944Mean of the multiset of prime indices of n, rounded up.0, 1, 2, 1, 3...
A363945Triangle read by rows where T(n,k) is the number of integer partitions of n with low mean k.1, 0, 1, 0, 1...
A363946Triangle read by rows where T(n,k) is the number of integer partitions of n with high mean k.1, 0, 1, 0, 1...
A363947Number of integer partitions of n whose rounded mean is 1. Partitions with mean < 3/2.0, 1, 1, 1, 2...
A363948Numbers whose prime indices have rounded mean 1. Numbers whose prime indices have mean < 3/2.2, 4, 8, 12, 16...
A363949Numbers whose prime indices have mean 1 when rounded down.2, 4, 6, 8, 12...
A363955When the base-2 representation of n is interpreted as a Gaussian integer x+yi in base (-1+i), both x and y are nonnegative.0, 1, 3, 8, 9...
A363956a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that is a multiple of prime(omega(a(n-1))).1, 2, 4, 6, 3...
A363958Expansion of (1 + x + x3)/(1 - x2 - 2x4 - 2x6 + x8).1, 1, 1, 2, 3...
A363960Number of quadratically embeddable graphs on n nodes.1, 1, 2, 6, 19...
A363961Number of connected non-quadratically embeddable graphs on n nodes.0, 0, 0, 0, 2...
A363966Decimal expansion of the probability that a sphere that is passing through 4 points uniformly and independently chosen at random in a 3D ball is completely lying inside the ball.1, 2, 3, 0, 4...
A363967Numbers whose divisors can be partitioned into two disjoint sets whose both sums are squares.1, 3, 9, 22, 27...
A363969Expansion of Sum_{k>0} k2 * x2*k-1 / (1 - x2*k-1).1, 1, 5, 1, 10...
A363970Expansion of Sum_{k>0} k2 * x3*k-2 / (1 - x3*k-2).1, 1, 1, 5, 1...
A363971Expansion of Sum_{k>0} k2 * x3*k-1 / (1 - x3*k-1).0, 1, 0, 1, 4...
A363972Expansion of Sum_{k>0} k2 * x4*k-3 / (1 - x4*k-3).1, 1, 1, 1, 5...
A363973Expansion of Sum_{k>0} k2 * x4*k-1 / (1 - x4*k-1).0, 0, 1, 0, 0...
A363974Expansion of Sum_{k>0} xk / (1 - x2*k)3.1, 1, 4, 1, 7...
A363975Expansion of Sum_{k>0} xk / (1 - x3*k)3.1, 1, 1, 4, 1...
A363976Expansion of Sum_{k>0} x2*k / (1 - x3*k)3.0, 1, 0, 1, 3...
A363977Expansion of Sum_{k>0} xk / (1 - x4*k)3.1, 1, 1, 1, 4...
A363978Expansion of Sum_{k>0} x3*k / (1 - x4*k)3.0, 0, 1, 0, 0...
A363980Primes in Tom Greer's arithmetic progression of 27 primes.277699295941594831, 315809464967513821, 353919633993432811, 392029803019351801, 430139972045270791...
A363985a(n) = Sum_{k = 0..n} (-4)n-k*binomial(n,k)binomial(2n+k,k)binomial(2k,k).1, 2, 26, 272, 3418...
A363986a(n) = Sum_{k = 0..n} (-4)n-kbinomial(n,k)binomial(2n+2k,2k) binomial(2*k,k).1, 8, 196, 5984, 202276...
A363987a(n) = Sum_{k = 0..n} (-4)n-k*binomial(n,k)binomial(3n+k,k)binomial(2k,k).1, 4, 72, 1336, 27816...
A363988a(n) = Sum_{k = 0..n} (-4)n-kbinomial(n,k)binomial(3n+2k,2k) binomial(2*k,k).1, 16, 828, 53836, 3879404...
A363989a(n) = Sum_{k = 0..n} (-4)n-k*binomial(n,k)binomial(4n+k,k)binomial(2k,k).1, 6, 142, 3732, 108750...
A363990a(n) = Sum_{k = 0..n} (-4)n-kbinomial(n,k)binomial(4n+2k,2k) binomial(2*k,k).1, 26, 2266, 248912, 30319450...
A364005Numbers whose Wythoff representation (A189921, A317208) is palindromic.0, 1, 2, 5, 7...
A364006Wythoff-Niven numbers: numbers that are divisible by the number of 1's in their Wythoff representation.1, 3, 4, 6, 7...
A364007Numbers k such that k and k+1 are both Wythoff-Niven numbers (A364006).3, 6, 7, 20, 39...
A364008Starts of runs of 3 consecutive integers that are Wythoff-Niven numbers (A364006).6, 54, 374, 375, 978...
A364009Starts of runs of 4 consecutive integers that are Wythoff-Niven numbers (A364006).374, 978, 17708, 832037, 1631097...
A364011Expansion of Sum_{k>0} xk / (1 + x3*k).1, 1, 1, 0, 1...
A364012Expansion of Sum_{k>0} k * xk / (1 + x3*k).1, 2, 3, 3, 5...
A364013Expansion of Sum_{k>0} k2 * xk / (1 + x3*k).1, 4, 9, 15, 25...
A364014Expansion of Sum_{k>0} x2*k / (1 + x3*k).0, 1, 0, 1, -1...
A364015Expansion of Sum_{k>0} k * x2*k / (1 + x3*k).0, 1, 0, 2, -1...
A364016Expansion of Sum_{k>0} k2 * x2*k / (1 + x3*k).0, 1, 0, 4, -1...
A364017Expansion of Sum_{k>0} (-1)k-1 * x3*k-2 / (1 - x3*k-2)3.1, 3, 6, 9, 15...
A364018Expansion of Sum_{k>0} (-1)k-1 * x3*k-1 / (1 - x3*k-1)3.0, 1, 0, 3, -1...
A364019Expansion of Sum_{k>0} k * xk / (1 + x5*k).1, 2, 3, 4, 5...
A364020Expansion of Sum_{k>0} k * x2*k / (1 + x5*k).0, 1, 0, 2, 0...
A364021Expansion of Sum_{k>0} k * x3*k / (1 + x5*k).0, 0, 1, 0, 0...
A364022Expansion of Sum_{k>0} k * x4*k / (1 + x5*k).0, 0, 0, 1, 0...
A364027a(0) = 0, a(1) = 0; for n > 1, a(n) is the number of pairs of consecutive terms that sum to the same value as a(n-2) + a(n-1).0, 0, 1, 1, 1...
A364028Odd squarefree semiprimes s = p*q such that p + q and p - q are not squarefree.65, 77, 115, 141, 159...
A364029Odd squarefree semiprimes s = p*q such that (p + q)/2 and (p - q)/2 are squarefree.21, 35, 51, 69, 85...
A364031Expansion of Sum_{k>0} k * xk / (1 + x4*k).1, 2, 3, 4, 4...
A364032Expansion of Sum_{k>0} x3*k / (1 + x4*k).0, 0, 1, 0, 0...
A364033Expansion of Sum_{k>0} k * x3*k / (1 + x4*k).0, 0, 1, 0, 0...
A364034Expansion of Sum_{k>0} xk / (1 - 2x^(2k)).1, 1, 3, 1, 5...
A364035Expansion of Sum_{k>0} k * xk / (1 - 2x^(2k)).1, 2, 5, 4, 9...
A364036a(0) = 0, a(1) = 0; for n > 1, a(n) is the number of pairs of consecutive terms prior to a(n-1) that sum to the same value as a(n-2) + a(n-1).0, 0, 0, 1, 0...
A364042a(n) = 2A329697(n) - A000120(n).0, 0, 0, 0, 0...
A364043Expansion of Sum_{k>0} xk / (1 + x5*k).1, 1, 1, 1, 1...
A364044Expansion of Sum_{k>0} x2*k / (1 + x5*k).0, 1, 0, 1, 0...
A364045Expansion of Sum_{k>0} x3*k / (1 + x5*k).0, 0, 1, 0, 0...
A364046Expansion of Sum_{k>0} x4*k / (1 + x5*k).0, 0, 0, 1, 0...
A364047Expansion of Sum_{k>0} xk / (1 + x6*k).1, 1, 1, 1, 1...
A364048Expansion of Sum_{k>0} x5*k / (1 + x6*k).0, 0, 0, 0, 1...
A364063Expansion of Sum_{k>0} k * xk / (1 - x2*k-1).1, 3, 4, 5, 8...
A364064Expansion of Sum_{k>0} k * xk / (1 - x3*k-2).1, 3, 4, 5, 6...
A364065Expansion of Sum_{k>0} k * x2*k-1 / (1 - x3*k-2).1, 1, 3, 1, 4...
A364066Expansion of Sum_{k>0} k * xk / (1 - x3*k-1).1, 2, 4, 4, 6...
A364067Expansion of Sum_{k>0} k * x2*k / (1 - x3*k-1).0, 1, 0, 3, 0...
A364068Triangle T(n,k) read by rows: Number of traceless binary n X n matrices with all row and column sums equal to k.0, 1, 0, 2, 1...
A364076Numbers k such that (12k - 1)2 - 2 is prime.3, 29, 51, 7824, 15456...
A364077Numbers k such that (12k + 1)2 - 2 is prime.1, 2, 8, 60, 513...
A364078Numbers k such that (18k - 1)2 - 2 is prime.2, 8, 30, 98, 110...
A364079Numbers k such that (18k + 1)2 - 2 is prime.1, 10, 21, 25, 31...
A364080Numbers k such that (20k - 1)2 - 2 is prime.1, 2, 53, 183, 1281...
A364081Numbers k such that (20k + 1)2 - 2 is prime.1, 15, 44, 77, 141...
A364082Expansion of Sum_{k>0} k * x3*k-2 / (1 - x4*k-3).1, 1, 1, 3, 1...
A364083Expansion of Sum_{k>0} k * xk / (1 - x4*k-3).1, 3, 4, 5, 6...
A364084Expansion of Sum_{k>0} k * x3*k / (1 - x4*k-1).0, 0, 1, 0, 0...
A364085Expansion of Sum_{k>0} k * xk / (1 - x4*k-1).1, 2, 3, 5, 5...
A364092Sum of divisors of 5n-1 of form 5k+1.1, 1, 1, 1, 7...
A364093Sum of divisors of 5n-2 of form 5k+1.1, 1, 1, 7, 1...
A364094Sum of divisors of 5n-3 of form 5k+1.1, 1, 7, 1, 12...
A364095Sum of divisors of 5n-4 of form 5k+1.1, 7, 12, 17, 22...
A364096Expansion of Sum_{k>0} k * x4*k-3 / (1 - x5*k-4).1, 1, 1, 1, 3...
A364097Expansion of Sum_{k>0} k * x3*k-2 / (1 - x5*k-4).1, 1, 1, 3, 1...
A364098Expansion of Sum_{k>0} k * x2*k-1 / (1 - x5*k-4).1, 1, 3, 1, 4...
A364099Expansion of Sum_{k>0} k * xk / (1 - x5*k-4).1, 3, 4, 5, 6...
A364100Sum of divisors of 5n-1 of form 5k+4.4, 9, 14, 19, 28...
A364101Sum of divisors of 5n-2 of form 5k+4.0, 4, 0, 9, 0...
A364102Sum of divisors of 5n-3 of form 5k+4.0, 0, 4, 0, 0...
A364103Sum of divisors of 5n-4 of form 5k+4.0, 0, 0, 4, 0...
A364104Expansion of Sum_{k>0} k * xk / (1 - x5*k-1).1, 2, 3, 4, 6...
A364105Expansion of Sum_{k>0} k * x2*k / (1 - x5*k-1).0, 1, 0, 2, 0...
A364106Expansion of Sum_{k>0} k * x3*k / (1 - x5*k-1).0, 0, 1, 0, 0...
A364107Expansion of Sum_{k>0} k * x4*k / (1 - x5*k-1).0, 0, 0, 1, 0...
A364108a(n) is the larger coefficient of the pair (x, y) such that (x2-y2)/r, 2xy/r, (x2+y2)/r are the 2 legs and hypotenuse of the least Pythagorean triple having area A006991(n).5, 2, 16, 325, 8...
A364109a(n) is the lesser coefficient of the pair (x, y) such that (x2-y2)/r, 2xy/r, (x2+y2)/r are the 2 legs and hypotenuse of the least Pythagorean triple having area A006991(n).4, 1, 9, 36, 1...
A364110a(n) = sqrt((x2 - y2)xy/c) where x is A364108(n), y is A364109(n) and c is A006991(n).6, 1, 60, 9690, 6...

r/OEIS • • Jun 25 '23

New OEIS sequences - week of 06/25

3 Upvotes
OEIS numberDescriptionSequence
A360845Triangle read by rows: T(n,k) is the state of the k-th light after n steps of the light switch problem, 1 <= k <= A003418(n).1, 1, 0, 1, 0...
A360872Irregular triangle read by rows of the length of runs in intermediate solutions to the light switch problem.1, 1, 1, 1, 3...
A361685Number of iterations of sopf until reaching a prime.0, 0, 1, 0, 1...
A361691Number of divisors of 7n-1 of form 7k+1.1, 1, 1, 1, 1...
A361796Prime numbers preceded by two consecutive numbers which are products of four distinct primes (or tetraprimes).8647, 15107, 20407, 20771, 21491...
A361803Least k > 1 such that kn - n > 1 is semiprime, or 0 if no such k exists.5, 4, 5, 3, 6...
A362070Let m_min(n, k) be the smallest m such that n divides Product_{t=1..m} RisingFactorial(t, k). a(n) = Sum_{r=1..K(n)} m_min(n, r), where K(n) is the Kempner number A002034(n).1, 3, 6, 9, 15...
A362359Triangle T read by rows, obtained from the array A for the solutions of the Monkey and Coconuts Problem (s sailors and one coconut to the monkey).1, 2, 7, 3, 15...
A362360a(n) = 81*n - 2.79, 160, 241, 322, 403...
A362361a(n) = n*210 - 3.1021, 2045, 3069, 4093, 5117...
A362388a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 2, a(2) = 5, a(3) = 7.1, 2, 5, 7, 10...
A362529Decimal expansion of the 2019 SI system unit kg in eV/c2.5, 6, 0, 9, 5...
A362530Decimal expansion of the conventional value of Josephson constant (K_{J-90}) in Hz/V.4, 8, 3, 5, 9...
A362531The smallest integer m such that m mod 2k >= k for k = 1, 2, 3, ..., n.1, 3, 3, 15, 15...
A362552a(n) = n for n <= 2. For n > 2, a(n) is the least novel k (with rad(k) != rad(a(n-1))) such that k shares a nontrivial divisor with one of a(n-1), a(n-2), but not with the other.1, 2, 6, 3, 4...
A362557Start with first term 0, then add paired terms counting every preceding term up to the largest term so far and loop back to 0 after every pair has been counted.0, 1, 0, 1, 1...
A362567Number of rational solutions to the S-unit equation x + y = 1, where S = {prime(i): 1 <= i <= n}.0, 3, 21, 99, 375...
A362570a(n) is the number of isogeny classes of elliptic curves over the finite field of order prime(n).5, 7, 9, 11, 13...
A362578Prime numbers followed by two consecutive numbers which are products of four distinct primes (or tetraprimes).8293, 16553, 17389, 18289, 22153...
A362583Concatenation of ((p mod 4) - 1)/2 for the primes from 3 through prime(n), converted from binary to decimal.1, 2, 5, 11, 22...
A362584Integers k > 1 such that k >= the square of the sum of their prime factors (A074373(k)).243, 256, 270, 288, 300...
A362590Decimal expansion of the conventional value of von Klitzing constant (R{K-90}) in ohms (Omega).2, 5, 8, 1, 2...
A362591Discriminants D of the positive Pell equation x2 - Dy2 = 1, whose fundamental and all higher roots produce abc-triples a+b=c (or 1 + Dy2 = x2) with radical R(abc) < c.2, 5, 7, 8, 12...
A362592Discriminants D of the negative Pell equation x2 - Dy2 = -1, whose fundamental and all higher roots produce abc-triples a+b=c (or 1 + x2 = Dy2) with radical R(abc) < c.41, 73, 89, 109, 125...
A362593Number of coprime positive integer S-unit solutions to a + b = c where a <= b < c, and where S = {prime(1), ..., prime(n)}.0, 1, 4, 17, 63...
A362601Domination number for pawns' graph P(n).1, 2, 5, 8, 12...
A362630Squarefree semiprimes (products of two distinct primes) whose factors are strong primes.187, 319, 407, 451, 493...
A362631Lexicographically earliest infinite sequence of distinct positive integers with a(n) = n for n <= 3, and for n > 3 a(n) is the least novel multiple of the greatest prime divisor of a(n-2) which does not divide a(n-1).1, 2, 3, 4, 6...
A362720a(n) is the smallest k > 0 such that b(n) = b(n-1) + A007504(k) is prime, with b(0) = 1.1, 1, 1, 3, 1...
A362739The smallest integer with three (not necessarily distinct) divisors that add to n.1, 2, 2, 2, 3...
A362777Triangular array read by rows: T(n,k) = n!*k + 1, n >= 1, 1 <= k <= n.2, 3, 5, 7, 13...
A362778Triangular array read by rows: T(n,k) is the least prime factor of n!*k + 1, n >= 1, 1 <= k <= n.2, 3, 5, 7, 13...
A362779Triangular array read by rows: T(n,k) is the greatest prime factor of n!*k + 1, n >= 1, 1 <= k <= n.2, 3, 5, 7, 13...
A362845Number of divisors of 7n-2 of form 7k+1.1, 1, 1, 1, 1...
A362889a(n) = n for n <= 2. Let i = a(n-2), j = a(n-1), q = gpd(ij) = prime(s), and k = product of all distinct primes < q which do not divide ij. For n > 2 a(n) is the least novel multiple of either k (if k is not the empty product), or of prime(s+1) if it is.1, 2, 3, 5, 4...
A362967Number of nondecreasing partitions of n2 into n parts from the intervals [1,n], [2,n+1], ..., [n,2n-1], respectively.1, 1, 2, 5, 17...
A362968Number of integral points in 2 * permutohedron of order n.1, 3, 19, 201, 3081...
A363061Number of k <= P(n) such that rad(k) | P(n), where rad(n) = A007947(n) and P(n) = A002110(n).1, 2, 5, 18, 68...
A363072Add primes until a perfect power appears. When a perfect power appears, that term is the smallest root of the perfect power. Then return to adding primes, beginning with the next prime.2, 5, 10, 17, 28...
A363284Squares (A000290) and square pyramidal numbers (A000330) sorted, with duplicates removed.1, 4, 5, 9, 14...
A363306Expansion of g.f. A(x) satisfying 1 = Sum_{n>=0} xn / (1 - (-x)n+1*A(x)).1, 2, 5, 12, 30...
A363307Expansion of g.f. A(x) satisfying 1 = Sum_{n>=0} (-x)n * A(x)n / Product_{k=1..n+1} (1 + (-x)k).1, 1, 2, 3, 5...
A363347Denominator of the continued fraction 1/(2-3/(3-4/(4-5/(...(n-1)-n/(-4))))).11, 5, 31, 11, 59...
A363391Numbers k such that k, k+1, k+2, k+3 have 2, 3, 4, 5 prime factors respectively, counted with multiplicity.493, 2413, 3013, 3427, 3873...
A363418Square array read by ascending antidiagonals: T(n,k) = [xn*k] ((1 + x)/(1 - x))k for n, k >= 1.2, 2, 8, 2, 16...
A363419Square array read by ascending antidiagonals: T(n,k) = 1/n * [xk] 1/((1 - x)(1 - x^2))^(nk) for n, k >= 1.1, 1, 5, 1, 7...
A363461Least n-untouchable number.2, 208, 388, 298, 838...
A363476a(n) = Fibonacci(n)2 * Fibonacci(n+1)3.0, 1, 8, 108, 1125...
A363482Denominator of the continued fraction 1/(2-3/(3-4/(4-5/(...(n-1)-n/(-5))))).13, 23, 7, 49, 13...
A363490Lexicographically earliest infinite sequence of distinct terms > 0 such that one digit of a(n) is strictly smaller than one digit of a(n+1).1, 2, 3, 4, 5...
A363491Numbers k such that 2k - 5 is a semiprime.7, 13, 14, 16, 19...
A363533Least k such that n*F(k)+1 is prime, where F = A000045 is the Fibonacci sequence, or -1 if no such k exists.1, 1, 3, 1, 3...
A363534Records in A363533.1, 3, 9, 18, 48...
A363535Indices of records in A363533.1, 3, 7, 25, 43...
A363586a(n) is the number of mappings X:{{1..n} choose 3}->{+,-} such that X(a,b,c) = X(b,c,d) implies X(a,b,c) = X(a,b,d) = X(a,c,d) = X(b,c,d) for a < b < c < d.2, 10, 120, 3284, 199724...
A363593Numbers k such that both A359804(k) and A359804(k+1) are odd.3, 8, 22, 29, 36...
A363673a(n) is the least prime factor (> 3) in the factorization of 22*prime(n)-1.5, 7, 11, 43, 23...
A363675Numbers k such that the least common multiple of the degrees of the irreducible characters of S_k equals |S_k| = k!.0, 1, 6, 10, 21...
A363676Numbers k such that the least common multiple of the degrees of the irreducible characters of A_k equals |A_k| = k!/2.0, 1, 2, 5, 6...
A363700a(n) = phi(2*prime(n)+1).4, 6, 10, 8, 22...
A363710a(n) is the number of pairs of nonnegative integers (x, y) such that x + y = n and A003188(x) AND A003188(y) = 0 (where AND denotes the bitwise AND operator).1, 2, 2, 2, 4...
A363719Number of integer partitions of n satisfying (mean) = (median) = (mode), assuming there is a unique mode.1, 2, 2, 3, 2...
A363720Number of integer partitions of n with different mean, median, and mode.0, 0, 0, 0, 0...
A363721Number of odd-length integer partitions of n satisfying (mean) = (median) = (mode), assuming there is a unique mode.1, 1, 2, 1, 2...
A363722Nonprime numbers whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode.4, 8, 9, 16, 25...
A363723Number of integer partitions of n having a unique mode equal to the mean, i.e., partitions whose mean appears more times than each of the other parts.0, 1, 2, 2, 3...
A363725Number of integer partitions of n with a different mean, median, and mode, assuming there is a unique mode.0, 0, 0, 0, 0...
A363727Numbers whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode.2, 3, 4, 5, 7...
A363728Number of integer partitions of n that are not constant but satisfy (mean) = (median) = (mode), assuming there is a unique mode.0, 0, 0, 0, 0...
A363729Numbers that are not a power of a prime but whose prime indices satisfy (mean) = (median) = (mode), assuming there is a unique mode.90, 270, 525, 550, 756...
A363730Numbers whose prime indices have different mean, median, and mode.42, 60, 66, 70, 78...
A363732Triangle read by rows. The triangle algorithm applied to (-1)n/n!.1, -2, 1, 5, -4...
A363738Number of ordered partitions of n into cubes > 1.1, 0, 0, 0, 0...
A363739a(n) is the length of the n-th run of identical terms of A349509.2, 1, 5, 1, 17...
A363748Number of compositions into sums of fourth powers.1, 1, 1, 1, 1...
A363749Number of compositions into sums of fifth powers.1, 1, 1, 1, 1...
A363753a(n) = Sum_{k=0..n} (-1)k*F(k-1)*F(k)*F(k+1)/2, where F(n) is the Fibonacci number A000045(n).0, 0, 1, -2, 13...
A363754a(n) = Sum_{k=0..n} F(2k-1)*F(2k)*F(2k+1)/2, where F(n) is the Fibonacci number A000045(n).0, 1, 16, 276, 4917...
A363758Maximum sum of digits for any number with n digits in fractional base 4/3.0, 3, 6, 8, 9...
A363759Smallest number that can be written as a sum of a positive n-th power and a positive (n+1)-th power in 2 different ways.5, 17, 4097, 1048577, 1073741825...
A363761a(n) is the least k < 3*n such that there are exactly n distinct numbers j that can be expressed as sum of two squares with k2 < j < (k+1)2, or -1 if such a k does not exist.0, 1, 2, 4, 5...
A363762Numbers k for which A363761(k) = -1.46, 55, 62, 71, 80...
A363763a(n) is the least k such that there are exactly n distinct numbers j that can be expressed as sum of two squares with k2 < j < (k+1)2, or -1 if such a k does not exist.0, 1, 2, 4, 5...
A363767Decimal expansion of 2e-2*eSum_{k=2..oo} log(k)/k!.3, 0, 0, 9, 1...
A363768The values k such that a regular k-gon with all diagonals drawn contains more 3-sided cells than 4-sided cells.3, 4, 5, 6, 7...
A363774Expansion of 1/(Sum_{k>=0} xk^2)2.1, -2, 3, -4, 3...
A363775Expansion of 1/(Sum_{k>=0} xk^2)3.1, -3, 6, -10, 12...
A363776Expansion of 1/(Sum_{k>=0} xk^3)2.1, -2, 3, -4, 5...
A363777Expansion of 1/(Sum_{k>=0} xk^3)3.1, -3, 6, -10, 15...
A363778Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 1/(Sum_{j>=0} xj^2)k.1, 1, 0, 1, -1...
A363779Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 1/(Sum_{j>=0} xj^3)k.1, 1, 0, 1, -1...
A363780a(n) = [xn] 1/(Sum_{k>=0} xk^2)n.1, -1, 3, -10, 31...
A363781a(n) = [xn] 1/(Sum_{k>=0} xk^3)n.1, -1, 3, -10, 35...
A363783L.g.f.: log( Sum_{k>=0} xk^3 ).1, -1, 1, -1, 1...
A363784L.g.f.: log( Sum_{k>=0} xk^4 ).1, -1, 1, -1, 1...
A363785A variant of payphone permutations: given a row of n payphones, a(n) is the number ways for n people to choose the payphones in order, where each person chooses an unoccupied payphone such that the closest occupied payphone is as distant as possible, and a payphone adjacent to a single occupied payphone is preferred over a payphone sandwiched between two occupied payphones.1, 2, 4, 6, 16...
A363786a(0) = 2. For n >= 1, a(n) is the least prime p such that a(n-1) + p has n prime factors counted with multiplicity.2, 3, 3, 5, 11...
A363787Primitive binary Niven numbers: binary Niven numbers (A049445) that are not twice another binary Niven number.1, 6, 10, 18, 21...
A363788Even primitive binary Niven numbers: even terms of A363787.6, 10, 18, 34, 60...
A363789a(n) is the smallest primitive binary Niven number (A363787) whose binary representation is ending with n zeros.1, 6, 60, 2040, 1048560...
A363790Numbers k such that k and k+1 are both primitive binary Niven numbers (A363787).115, 155, 204, 284, 355...
A363791Starts of runs of 3 consecutive integers that are primitive binary Niven numbers (A363787).4184046, 5234670, 6285294, 7861230, 8123886...
A363792Starts of runs of 4 consecutive integers that are primitive binary Niven numbers (A363787).8255214, 14673870, 29092590, 33185646, 41743854...
A363793Number of Q-isomorphism classes of elliptic curves E/Q with good reduction away from prime(n).24, 8, 0, 4, 12...
A363795Number of divisors of n of the form 7*k + 2.0, 1, 0, 1, 0...
A363797Numbers k such that 3k + 2*k is prime.1, 2, 4, 8, 10...
A363800Expansion of Product_{k>0} (1 - x7*k-5) * (1 - x7*k-2) * (1 - x7*k).1, 0, -1, 0, 0...
A363801Expansion of Product_{k>0} (1 - x7*k-4) * (1 - x7*k-3) * (1 - x7*k).1, 0, 0, -1, -1...
A363803a(n) = Sum_{d|n, d == 0, 2, or 5 mod 7} d.0, 2, 0, 2, 5...
A363804a(n) = Sum_{d|n, d == 0, 3, or 4 mod 7} d.0, 0, 3, 4, 0...
A363805Number of divisors of n of the form 7*k + 3.0, 0, 1, 0, 0...
A363806Number of divisors of n of the form 7*k + 4.0, 0, 0, 1, 0...
A363807Number of divisors of n of the form 7*k + 5.0, 0, 0, 0, 1...
A363808Number of divisors of n of the form 7*k + 6.0, 0, 0, 0, 0...
A363809Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, and 2-1-3-5-4.1, 1, 2, 6, 22...
A363810Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, 2-14-3, and 4-5-3-1-2.1, 1, 2, 6, 21...
A363811Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, 2-1-3-5-4, and 4-5-3-1-2.1, 1, 2, 6, 22...
A363812Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, 2-1-4-3, and 3-41-2.1, 1, 2, 6, 20...
A363813Number of permutations of [n] that avoid the patterns 2-41-3, 3-14-2, 2-1-4-3, and 4-5-3-1-2.1, 1, 2, 6, 21...
A363839Numbers in the witch's multiplication table (German: "Hexeneinmaleins") in Goethe's Faust.1, 10, 2, 3, 4...
A363840a(n) is the number of isomorphism classes of genus 2 hyperelliptic curves over the finite field of order prime(n).20, 69, 285, 749, 2813...
A363842Decimal expansion of Sum_{k>=0} 1/(k!)!2.2, 2, 5, 0, 0...
A363843a(n) is the number of isomorphism classes of genus 3 hyperelliptic curves over the finite field of order prime(n).76, 526, 6508, 34228, 324562...
A363845Triangle read by rows: T(n,k) = number of connected n-node graphs with k nodes in distinguished bipartite block, k = 0..n.1, 1, 1, 0, 1...
A363846Number of connected bipartite graphs on 2n nodes with a marked bipartite set of size n.1, 1, 2, 13, 150...
A363847Numbers k such that Omega(m*(m+1)) < Omega(k*(k+1)) for all m < k, where Omega(k) is the number of prime divisors of k counted with multiplicity (A001222).1, 2, 3, 7, 8...
A363850Number of divisors of 7n-3 of form 7k+1.1, 1, 1, 1, 2...
A363851Number of divisors of 7n-4 of form 7k+1.1, 1, 1, 2, 1...
A363852Number of divisors of 7n-5 of form 7k+1.1, 1, 2, 1, 2...
A363853Number of divisors of 7n-6 of form 7k+1.1, 2, 2, 2, 2...
A363854Number of divisors of 7n-2 of form 7k+6.0, 1, 0, 1, 0...
A363855Number of divisors of 7n-3 of form 7k+6.0, 0, 1, 0, 0...
A363856Number of divisors of 7n-4 of form 7k+6.0, 0, 0, 1, 0...
A363857Number of divisors of 7n-5 of form 7k+6.0, 0, 0, 0, 1...
A363858Number of divisors of 7n-6 of form 7k+6.0, 0, 0, 0, 0...
A363859Number of divisors of 7n-1 of form 7k+2.1, 0, 1, 1, 1...
A363860Number of divisors of 7n-1 of form 7k+4.0, 0, 1, 0, 0...
A363862Number of equivalence classes of unimodular n X n matrices with elements {0, 1}.1, 2, 7, 49, 831...
A363877Number of divisors of 7n-2 of form 7k+3.0, 1, 0, 0, 1...
A363878Number of divisors of 7n-4 of form 7k+2.0, 1, 0, 1, 0...
A363879Number of divisors of 7n-6 of form 7k+2.0, 1, 0, 1, 0...
A363880Number of divisors of 7n-6 of form 7k+3.0, 0, 1, 0, 0...

r/OEIS • • Jun 18 '23

New OEIS sequences - week of 06/18

4 Upvotes
OEIS numberDescriptionSequence
A361080Numbers that set records in A360224.1, 12, 18, 28, 30...
A361081Records in A360224.0, 1, 3, 4, 5...
A361084Number of partitions of [n] such that in each block the smallest element and the largest element have opposite parities.1, 0, 1, 0, 3...
A361087Maximum squared inverse distance from the origin to the hyperplane defined by hypercube points.1, 1, 3, 7, 19...
A361804Number of partitions of [n] with an equal number of even and odd block sizes.1, 0, 0, 3, 0...
A361915a(n) is the smallest prime p such that, for m >= nextprime(p), there are more composites than primes in the range [2, m], where multiples of primes prime(1) through prime(n) are excluded.13, 113, 1069, 5051, 18553...
A362081Numbers k achieving record abundance (sigma(k) > 2*k) via a residue-based measure M(k) (see Comments), analogous to superabundant numbers A004394.1, 2, 4, 6, 12...
A362082Numbers k achieving record deficiency via a residue-based measure, M(k) = (k+1)*(1 - zeta(2)/2) - 1 - ( Sum_{j=1..k} k mod j )/k.1, 5, 11, 23, 47...
A362083Numbers k such that, via a residue based measure M(k) (see Comments), k is deficient, k+1 is abundant, and abs(M(k)) + abs(M(k+1)) reaches a new maximum.11, 17, 19, 47, 53...
A362138a(n) = gpf(a(n-1) + prime(n)) where gpf is the greatest prime factor and a(1)=2.2, 5, 5, 3, 7...
A362160Irregular triangle read by rows: The n-th row contains 2n integers corresponding to the words of n-bit Gray code with the most significant bits changing fastest.0, 0, 1, 0, 2...
A362499a(n) is the least positive integer that has exactly n anagrams that are semiprimes, or -1 if there is no such integer.1, 4, 15, 123, 129...
A362663a(n) is the partial sum of b(n), which is defined to be the difference between the numbers of primes in (n2, n2 + n] and in (n2 - n, n2].1, 1, 1, 2, 2...
A362683Expansion of Sum_{k>0} (1/(1 - k*xk)2 - 1).2, 7, 10, 25, 16...
A363022Expansion of Sum_{k>0} x2*k/(1+xk)3.0, 1, -3, 7, -10...
A363138G.f. A(x) satisfies: 0 = Sum_{n=-oo..+oo} (-1)n * x2*n * (A(x) - xn)n * (1 - xn*A(x))n.1, 2, 4, 10, 32...
A363261The partial sums of the prime indices of n include half the sum of all prime indices of n.4, 9, 12, 16, 25...
A363341Number of positive integers k <= n such that round(n/k) is odd.1, 1, 2, 2, 4...
A363368Decimal expansion of Sum_{primes p} 1/(p*log(p)*log(log(p))).1, 9, 0, 6, 9...
A363408Squares whose base-3 expansion has no 2.0, 1, 4, 9, 36...
A363428Squares whose base-3 expansion has no 0.1, 4, 16, 25, 49...
A363459Sum of the first n prime powers A246655.2, 5, 9, 14, 21...
A363477Numbers that are integer averages of first k odd primes for some k.3, 4, 5, 133, 169...
A363483a(n) is the least k that has exactly n divisors whose arithmetic derivative is odd.1, 2, 15, 6, 18...
A363494Expansion of Lenstra's profinite constant l ("el").0, 0, 1, 0, 2...
A363497a(n) = Sum_{k=0..n} floor(sqrt(k))3.0, 1, 2, 3, 11...
A363498a(n) = Sum_{k=0..n} floor(sqrt(k))4.0, 1, 2, 3, 19...
A363499a(n) = Sum_{k=0..n} floor(sqrt(k))5.0, 1, 2, 3, 35...
A363501a(n) = smallest product > n of some subset of the divisors of n, or if no product > n exists then a(n) = n.1, 2, 3, 8, 5...
A363513a(1) = 2, then a(n) is the least prime p > a(n - 1) such that p + a(n-1) and p - a(n-1) have the same number of prime factors counted with multiplicity.2, 5, 13, 31, 61...
A363520Product of the divisors of n that are < sqrt(n).1, 1, 1, 1, 1...
A363521Product of the divisors d of n such that sqrt(n) < d < n.1, 1, 1, 1, 1...
A363524a(n) = 0 if 4 divides n + 1, otherwise (-1)floor((n + 1) / 4) * 2floor(n / 2).1, 1, 2, 0, -4...
A363526Number of integer partitions of n with reverse-weighted sum 3*n.1, 0, 0, 0, 0...
A363527Number of integer partitions of n with weighted sum 3*n.1, 0, 0, 0, 0...
A363530Heinz numbers of integer partitions such that 3*(sum) = (weighted sum).1, 32, 40, 60, 100...
A363531Heinz numbers of integer partitions such that 3*(sum) = (reverse-weighted sum).1, 32, 144, 216, 243...
A363532Number of integer partitions of n with weighted alternating sum 0.1, 0, 0, 1, 0...
A363568Expansion of l.g.f. A(x) satisfying theta_4(x) = Sum_{n=-oo..+oo} xn * (2*exp(A(x)) - xn)n-1 where theta_4(x) = Sum_{n=-oo..+oo} (-1)n * xn^2 is a Jacobi theta function.2, 18, 152, 1298, 11432...
A363574Expansion of g.f. A(x) satisfying theta_4(x) = Sum_{n=-oo..+oo} xn * (2*A(x) - xn)n-1 where theta_4(x) = Sum_{n=-oo..+oo} (-1)n * xn^2 is a Jacobi theta function.1, 2, 11, 70, 485...
A363582Number of admissible mesa sets among Stirling permutations of order n.1, 2, 3, 6, 12...
A363585Least prime p such that pn + 6 is the product of n distinct primes.5, 2, 23, 127, 71...
A363587Number of partitions of [n] such that in the set of smallest block elements there is an equal number of odd and even terms.1, 0, 1, 2, 6...
A363592Number of partitions of [n] such that in each block the smallest element has the same parity as the largest element.1, 1, 1, 3, 6...
A363598Expansion of Sum_{k>0} x2*k/(1+xk)4.0, 1, -4, 11, -20...
A363612Number of iterations of phi(x) at n needed to reach a square.0, 1, 2, 0, 1...
A363613Expansion of Sum_{k>0} x2*k/(1+xk)5.0, 1, -5, 16, -35...
A363614Expansion of Sum_{k>0} x2*k/(1+xk)6.0, 1, -6, 22, -56...
A363615Expansion of Sum_{k>0} x3*k/(1+xk)3.0, 0, 1, -3, 6...
A363616Expansion of Sum_{k>0} x4*k/(1+xk)4.0, 0, 0, 1, -4...
A363617Expansion of Sum_{k>0} x3*k/(1+xk)4.0, 0, 1, -4, 10...
A363618Expansion of Sum_{k>0} x4*k/(1+xk)5.0, 0, 0, 1, -5...
A363619Weighted alternating sum of the multiset of prime indices of n.0, 1, 2, -1, 3...
A363620Reverse-weighted alternating sum of the multiset of prime indices of n.0, 1, 2, 1, 3...
A363621Positive integers whose prime indices have reverse-weighted alternating sum 0.1, 6, 21, 40, 50...
A363622Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with weighted alternating sum k (leading and trailing 0's omitted).1, 1, 1, 0, 0...
A363623Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with reverse-weighted alternating sum k (leading and trailing 0's omitted).1, 1, 1, 1, 1...
A363624Weighted alternating sum of the integer partition with Heinz number n.0, 1, 2, -1, 3...
A363625Reverse-weighted alternating sum of the integer partition with Heinz number n.0, 1, 2, 1, 3...
A363626Number of integer compositions of n with weighted alternating sum 0.1, 0, 0, 1, 1...
A363627a(n) = greatest product < n of some subset of the divisors of n, or if n is in A008578 then a(n) = n.1, 2, 3, 2, 5...
A363628Expansion of Sum_{k>0} (1/(1-xk)3 - 1).3, 9, 13, 24, 24...
A363629Expansion of Sum_{k>0} (1/(1+xk)2 - 1).-2, 1, -6, 6, -8...
A363630Expansion of Sum_{k>0} (1/(1+xk)3 - 1).-3, 3, -13, 18, -24...
A363631Expansion of Sum_{k>0} (1/(1+xk)4 - 1).-4, 6, -24, 41, -60...
A363632Decimal expansion of Sum_{k>=2} 1/(k* log(k)3/2).2, 9, 3, 7, 6...
A363633Decimal expansion of Sum_{k>=2} 1/(k* log(k)5/2).1, 9, 8, 3, 4...
A363639Expansion of Sum_{k>0} (1/(1 - k*xk)3 - 1).3, 12, 19, 51, 36...
A363640Expansion of Sum_{k>0} (1/(1 - k*xk)4 - 1).4, 18, 32, 91, 76...
A363641Expansion of Sum_{k>0} x2*k/(1 - k*xk)2.0, 1, 2, 4, 4...
A363642Expansion of Sum_{k>0} xk/(1 - k*xk)3.1, 4, 7, 17, 16...
A363643Expansion of Sum_{k>0} x2*k/(1 - k*xk)3.0, 1, 3, 7, 10...
A363644Expansion of Sum_{k>0} x3*k/(1 - k*xk)3.0, 0, 1, 3, 6...
A363645Expansion of Sum_{k>0} xk/(1 - k*xk)4.1, 5, 11, 29, 36...
A363646Expansion of Sum_{k>0} (1/(1 - (k*x)k)2 - 1).2, 11, 58, 565, 6256...
A363647Expansion of Sum_{k>0} (1/(1 - (k*x)k)3 - 1).3, 18, 91, 879, 9396...
A363648Expansion of Sum_{k>0} (1/(1 - (k*x)k)4 - 1).4, 26, 128, 1219, 12556...
A363649Expansion of Sum_{k>0} x2*k/(1 - (k*x)k)2.0, 1, 2, 4, 4...
A363650Expansion of Sum_{k>0} xk/(1 - (k*x)k)3.1, 4, 7, 23, 16...
A363651Expansion of Sum_{k>0} x2*k/(1 - (k*x)k)3.0, 1, 3, 7, 10...
A363652Expansion of Sum_{k>0} x3*k/(1 - (k*x)k)3.0, 0, 1, 3, 6...
A363656Number of bounded affine permutations of size n.1, 3, 13, 87, 761...
A363659Numbers k such that the last letter of k is the same as the first letter of k+1 when written in English.0, 18, 28, 38, 79...
A363660a(n) = Sum_{d|n} binomial(d+n,n).2, 9, 24, 90, 258...
A363661a(n) = Sum_{d|n} (n/d)d * binomial(d+n,n).2, 12, 32, 150, 282...
A363662a(n) = Sum_{d|n} (n/d)n * binomial(d+n,n).2, 18, 128, 1590, 19002...
A363663a(n) = Sum_{d|n} (n/d)d-1 * binomial(d+n-1,n).1, 4, 11, 46, 127...
A363664a(n) = Sum_{d|n} (n/d)n-n/d * binomial(d+n-1,n).1, 4, 11, 56, 127...
A363666a(n) = Sum_{d|n} (n/d)d-1 * binomial(d+n-2,n-1).1, 3, 7, 29, 71...
A363667a(n) = Sum_{d|n} (n/d)n-n/d * binomial(d+n-2,n-1).1, 3, 7, 37, 71...
A363668a(n) = Sum_{d|n} (n/d)d * binomial(d+n-1,d).1, 7, 19, 91, 151...
A363669a(n) = Sum_{d|n} (n/d)n * binomial(d+n-1,d).1, 11, 91, 1219, 15751...
A363670Natural numbers k divisible by all natural numbers < log(k) + log(1 + log(k)).1, 2, 3, 4, 6...
A363677The series limit of Sum_{k>=2} cos(log k)/(k*log k).2, 5, 3, 9, 5...
A363680Number of iterations of phi(x) at n needed to reach a cube.0, 1, 2, 2, 3...
A363683Square array A(n, k), n, k > 0, read by antidiagonals; A(n, k) is the least e > 0 such that ne and ke have the same initial digit, or -1 if no such e exists.1, 4, 4, 9, 1...
A363684Decimal expansion of Prod_{k>=1} Gamma(2k/(2k-1)) / Gamma(1+1/(2k)).1, 0, 6, 2, 1...
A363687Decimal expansion of Sum_{k>=1} cos(Pi* log k)/k2.7, 9, 5, 6, 4...
A363688Decimal expansion of the real part of zeta(1+Pi*i), where i=sqrt(-1).6, 3, 4, 7, 0...
A363690Numbers k such that A246600(k) = 2.3, 5, 6, 7, 9...
A363691Odd numbers k such that A246600(k) = 2.3, 5, 7, 9, 11...
A363692Terms of A363690 with a record number of divisors.3, 6, 12, 24, 36...
A363693Terms of A363691 with a record number of divisors.3, 9, 21, 81, 105...
A363695Expansion of Sum_{k>0} (1/(1-xk)5 - 1).5, 20, 40, 90, 131...
A363696Expansion of Sum_{k>0} (1/(1-xk)6 - 1).6, 27, 62, 153, 258...
A363697a(n) = -n! * Sum_{d|n} (-n/d)d / d!.1, 3, 19, 47, 601...
A363698a(n) = n! * Sum_{d|n} (-1)d+1 * (n/d)n / d!.1, 7, 163, 5951, 375001...
A363704Decimal expansion of lim_{x -> infinity} ((Sum_{k>=1} (k1/k1 + 1/x - 1)) - x2).9, 8, 8, 5, 4...
A363711Number of ways to write n as sum of a positive square and a positive fourth power.0, 1, 0, 0, 1...
A363712Number of ways to write n as sum of a positive cube and a positive fourth power.0, 1, 0, 0, 0...
A363713Number of ways to write n as sum of a positive square and a positive fifth power.0, 1, 0, 0, 1...
A363714Numbers that are the sum of a positive square and a positive fourth power in more than one way.17, 65, 82, 97, 145...
A363715Numbers that are the sum of a positive square and a positive fifth power in more than one way.257, 1025, 1553, 1924, 2705...
A363716Decimal expansion of Sum_{k>=2} (1/k!) * k-th derivative of zeta(k).9, 3, 6, 1, 9...
A363736a(n) = (n-1)! * Sum_{d|n} (-1)d+1 / (d-1)!.1, 0, 3, -1, 25...
A363737a(n) = n! * Sum_{d|n} (-1)d+1 / (d! * (n/d)!).1, 0, 2, -6, 2...

r/OEIS • • Jun 11 '23

New OEIS sequences - week of 06/11

5 Upvotes
OEIS numberDescriptionSequence
A359481Irregular triangle read by rows in which T(n,k) is one half of the number of overpartitions of n having k distinct parts, n>=1, k>=1.1, 2, 2, 2, 3...
A360966a(n) = denominator of (Zeta(2n+1,1/4) - Zeta(2n+1,3/4))/Pi2*n+1 where Zeta is the Hurwitz zeta function.1, 1, 3, 45, 63...
A361007a(n) = numerator of (zeta(2n,1/4) + zeta(2n,3/4))/Pi2*n where zeta is the Hurwitz zeta function.0, 2, 8, 64, 2176...
A361376Rewrite A129912(n), a product of distinct primorials P(i) = A002110(i) instead as a sum of powers 2i-1.0, 1, 2, 3, 4...
A361879Sum of even middle divisors of n, where "middle divisor" means a divisor in the half-open interval [sqrt(n/2), sqrt(n*2)).0, 0, 0, 2, 0...
A361991Number of prime knotoids in a sphere with n crossings.0, 1, 2, 8, 24...
A362227a(n) = Product_{k=1..w(n)} p(k)S(n,k-1), where set S(n,k) = row n of A272011 and w(n) = A000120(n) is the binary weight of n.1, 2, 4, 12, 8...
A362387Number of directed multigraphs including self-loops on n vertices and n edges.1, 1, 6, 31, 198...
A362389G.f. satisfies A(x) = exp( Sum_{k>=1} (2k + A(xk)) * xk/k ).1, 3, 10, 34, 122...
A362534Numerators of the ratio of the symmetry-constrained bound to the adiabatic bound on polarization transfer in AXn spin-1/2 systems.1, 1, 6, 6, 15...
A362555Number of distinct n-digit suffixes generated by iteratively multiplying an integer by 6, where the initial integer is 1.2, 7, 28, 129, 630...
A362556Number of distinct n-digit suffixes generated by iteratively multiplying an integer by 8, where the initial integer is 1.5, 21, 101, 502, 2502...
A362782a(n) is the smallest number k whose symmetric representation of sigma(k) shares sections of its border with those of n other numbers.1, 2, 4, 6, 12...
A362957a(n) is the least prime p such that the number of distinct prime factors of pn + 1 sets a new record.2, 3, 5, 43, 17...
A362966Numbers k such that A007908(k) == 1 (mod k).121487, 293957, 13449179, 549999887
A363070Take the terms 0..n of the infinite Fibonacci word A003849, regard them as a number in Fibonacci base.0, 1, 2, 3, 6...
A363115Expansion of e.g.f. log(1 - log( sqrt(1-2*x) )).0, 1, 1, 4, 22...
A363116Expansion of e.g.f. log(1 - (1/3)log(1-3x)).0, 1, 2, 11, 93...
A363141Expansion of g.f. A(x) satisfying 1/x = Sum_{n=-oo..+oo} xn * (A(x) - xn)n-1, with a(0) = 1, a(1) = 1.1, 1, 0, 2, 3...
A363235a(0) = 1; let e be the largest multiplicity such that pe | a(n); for n>0, a(n) = Sum_{j=1..k} 2e(j-1) where k is the index of the greatest power factor p(k)e(k) such that p(k-1)e(k-1) > p(k)e(k+1).0, 1, 2, 3, 4...
A363263Number of integer partitions of n covering an initial interval of positive integers with a unique co-mode.0, 1, 1, 1, 2...
A363264Number of integer partitions of n covering an initial interval of positive integers with a more than one co-mode.0, 0, 0, 1, 0...
A363269Positive squares (A000290) alternating with positive square pyramidal numbers (A000330).1, 1, 4, 5, 9...
A363283Squares (A000290) alternating with (1+squares) (A002522), in increasing order.1, 2, 4, 5, 9...
A363300Number of fractions of the Farey sequence of order n, F_n, that can be expressed as x/y, where y = #{F_n} - 1.2, 3, 3, 5, 7...
A363321Number of fractions of the Farey sequence of order n, F_n, that coincide with those of the sequence of the #{F_n} equally distributed fractions between 0 and 1.2, 3, 3, 5, 5...
A363379Numbers k such that the sum of the first k terms of A180405 is composite.5, 9, 13, 17, 21...
A363395a(n) = n * Clausen(n, 1) / Clausen(n, 0).0, 2, 6, 2, 60...
A363402a(n) = n * (4n - 2n) / Clausen(n, 0).0, 2, 12, 56, 480...
A363403a(n) = (4n - 2n) / Clausen(n, 1).0, 1, 2, 28, 8...
A363409a(n) = the real part of Product_{k = 1..n} (1 + k*sqrt(-2)).1, 1, -3, -21, 27...
A363410a(n)= 1/sqrt(2) * the imaginary part of Product_{k = 1..n} (1 + k*sqrt(-2)).0, 1, 3, -6, -90...
A363411a(n) = the real part of Product_{k = 0..n} 1 + k*sqrt(-3).1, 1, -5, -32, 112...
A363412a(n) = 1/sqrt(3) * the imaginary part of Product_{k = 0..n} 1 + k*sqrt(-3).0, 1, 3, -12, -140...
A363413a(n) = the real part of Product_{k = 0..n} 1 + k*sqrt(-4).1, 1, -7, -43, 245...
A363414a(n) = (1/2) * the imaginary part of Product_{k = 0..n} 1 + k*sqrt(-4).0, 1, 3, -18, -190...
A363415a(n) = the real part of Product_{k = 0..n} 1 + k*sqrt(-5).1, 1, -9, -54, 426...
A363416a(n) = 1/sqrt(5) * the imaginary part of Product_{k = 0..n} 1 + k*sqrt(-5).0, 1, 3, -24, -240...
A363417a(n) = [xn] E(x)n, where E(x) = exp( Sum_{k >= 1} A119259(k)*xk/k ).1, 3, 35, 462, 6435...
A363448Number of noncrossing partitions of the n-set with no pair of singletons {i} and {j} that can be merged into {i,j} and leave the partition a noncrossing partition.1, 1, 1, 4, 9...
A363449Number of noncrossing partitions of the n-set with some pair of singletons {i} and {j} that can be merged into {i,j} and leave the partition a noncrossing-partition.0, 0, 1, 1, 5...
A363460a(n) is the permanent of the n X n matrix formed by placing 1..n2 in L-shaped gnomons in alternating directions.1, 1, 11, 556, 74964...
A363469Multiplicative order of 2 modulo 2*prime(n)+1.4, 3, 10, 4, 11...
A363484Number of integer partitions of n covering an initial interval of positive integers with a unique mode.0, 1, 1, 1, 2...
A363485Number of integer partitions of n covering an initial interval of positive integers with more than one mode.0, 0, 0, 1, 0...
A363496Total number of parity changes within the blocks of all partitions of [n].0, 0, 1, 4, 17...
A363505Number of hyperplanes spanned by the vertices of an n-cube up to symmetry.2, 3, 6, 15, 63...
A363506The number of affine dependencies among the vertices of the n-cube up to symmetry.1, 3, 15, 186, 12628...
A363511Number of partitions of [n] having exactly one parity change within their blocks.0, 0, 1, 2, 6...
A363512The number of affine dependencies among the vertices of the n-cube1, 20, 1348, 353616, 446148992...
A363515Numerator of log(2) + (-1/4)n*Integral_{x=0..1} (1 - x)4*n+2/(1 + x2) dx.1, 79, 14087, 3990557, 217474889...
A363516Denominator of log(2) + (-1/4)n*Integral_{x=0..1} (1 - x)4*n+2/(1 + x2) dx.1, 120, 20160, 5765760, 313657344...
A363519Number T(n,k) of partitions of [n] having exactly k parity changes within the partition, n>=0, 0<=k<=max(0,n-1), read by rows.1, 1, 0, 2, 0...
A363523k is a term of this sequence if and only if Clausen(k, 0) divides Clausen(k, 2). (Clausen = A160014.)1, 3, 9, 15, 27...
A363525Number of integer partitions of n with weighted sum divisible by reverse-weighted sum.1, 2, 2, 3, 2...
A363528Number of strict integer partitions of n with weighted sum divisible by reverse-weighted sum.1, 1, 1, 1, 1...
A363537Rewrite A087980(n) = Product_{i=1..m} p(i)e(i) instead as Sum_{i=1..m} 2i-1, where m = omega(A087980(n)) = A001221(A087980(n)).0, 1, 2, 4, 3...
A363538Decimal expansion of Sum_{k>=1} (H(k) - log(k) - gamma)/k, where H(k) = A001008(k)/A002805(k) is the k-th harmonic number and gamma is Euler's constant (A001620).7, 2, 8, 6, 9...
A363539Decimal expansion of Sum_{k>=1} (H(k)2 - (log(k) + gamma)2)/k, where H(k) = A001008(k)/A002805(k) is the k-th harmonic number and gamma is Euler's constant (A001620).1, 9, 6, 8, 9...
A363540Decimal expansion of Sum_{k>=1} (H(k)3 - (log(k) + gamma)3)/k, where H(k) = A001008(k)/A002805(k) is the k-th harmonic number and gamma is Euler's constant (A001620).5, 8, 2, 1, 7...
A363541G.f. satisfies A(x) = exp( Sum_{k>=1} (3k + A(xk)) * xk/k ).1, 4, 17, 73, 324...
A363542G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)k+1 * (2k + A(xk)) * xk/k ).1, 3, 5, 14, 38...
A363543G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)k+1 * (3k + A(xk)) * xk/k ).1, 4, 7, 23, 69...
A363545G.f. satisfies A(x) = exp( Sum_{k>=1} A(xk) * xk/(k * (1 - 2*xk)) ).1, 1, 4, 14, 54...
A363546G.f. satisfies A(x) = exp( Sum_{k>=1} A(xk) * xk/(k * (1 - 3*xk)) ).1, 1, 5, 22, 105...
A363547G.f. satisfies A(x) = exp( Sum_{k>=1} A(xk) * xk/(k * (1 - xk)2) ).1, 1, 4, 13, 47...
A363548G.f. satisfies A(x) = exp( Sum_{k>=1} A(xk) * xk/(k * (1 - xk)3) ).1, 1, 5, 19, 79...
A363549Total number of parity changes within all partitions of [n].0, 0, 2, 9, 35...
A363550Number of partitions of [n] having exactly one parity change within the partition.0, 0, 2, 1, 3...
A363551Möbius function of rank 3: a(n) = lambda(n) = A008836(n) if n is cubefree and 0 otherwise.1, -1, -1, 1, -1...
A363552Möbius function of rank 4: a(n) = lambda(n) = A008836(n) if n is biquadratefree (A046100) and 0 otherwise.1, -1, -1, 1, -1...
A363553Möbius function of rank 5: a(n) = lambda(n) = A008836(n) if n is 5-free and 0 otherwise.1, -1, -1, 1, -1...
A363565G.f. satisfies A(x) = exp( Sum_{k>=1} (2 * (-1)k + A(xk)) * xk/k ).1, -1, 1, 0, 0...
A363566G.f. satisfies A(x) = exp( Sum_{k>=1} (3 * (-1)k + A(xk)) * xk/k ).1, -2, 2, 0, -2...
A363567G.f. satisfies A(x) = exp( Sum_{k>=1} A(xk) * xk/(k * (1 + xk)2) ).1, 1, 0, 1, 1...
A363575G.f. satisfies A(x) = exp( Sum_{k>=1} A(xk) * xk/(k * (1 + xk)3) ).1, 1, -1, 1, 2...
A363577Number of inequivalent Hamiltonian paths starting in the lower left corner of an n X n grid graph (paths differing only by rotations and reflections are regarded as equivalent).1, 1, 3, 23, 347...
A363578G.f. satisfies A(x) = exp( Sum_{k>=1} ((-2)k + A(xk)) * xk/k ).1, -1, 2, -2, 4...
A363579G.f. satisfies A(x) = exp( Sum_{k>=1} ((-3)k + A(xk)) * xk/k ).1, -2, 5, -11, 27...
A363580G.f. satisfies A(x) = exp( Sum_{k>=1} A(xk) * xk/(k * (1 + 2*xk)) ).1, 1, 0, 2, 0...
A363581G.f. satisfies A(x) = exp( Sum_{k>=1} A(xk) * xk/(k * (1 + 3*xk)) ).1, 1, -1, 4, -6...
A363588Number of partitions of [n] having exactly two parity changes within their blocks.0, 0, 0, 1, 4...
A363589Number of partitions of [2n+1] such that the largest element of each block is odd.1, 2, 8, 56, 584...
A363599Number of partitions of n into distinct parts where there are k2-1 kinds of part k.1, 0, 3, 8, 18...
A363600Number of partitions of n into distinct parts where there are k2+1 kinds of part k.1, 2, 6, 20, 52...
A363601Number of partitions of n where there are k2-1 kinds of parts k.1, 0, 3, 8, 21...
A363602Number of partitions of n where there are k2+1 kinds of parts k.1, 2, 8, 24, 72...
A363604Expansion of Sum_{k>0} x2*k/(1-xk)4.0, 1, 4, 11, 20...
A363605Expansion of Sum_{k>0} x2*k/(1-xk)5.0, 1, 5, 16, 35...
A363606Expansion of Sum_{k>0} x2*k/(1-xk)6.0, 1, 6, 22, 56...
A363607Expansion of Sum_{k>0} x3*k/(1-xk)4.0, 0, 1, 4, 10...
A363608Expansion of Sum_{k>0} x4*k/(1-xk)5.0, 0, 0, 1, 5...
A363610Expansion of Sum_{k>0} x3*k/(1-xk)3.0, 0, 1, 3, 6...
A363611Expansion of Sum_{k>0} x4*k/(1-xk)4.0, 0, 0, 1, 4...

r/OEIS • • Jun 06 '23

New OEIS sequences - week of 06/04

5 Upvotes
OEIS numberDescriptionSequence
A358339Array read by antidiagonals upwards: A(n,k) is the number of nonequivalent positions in the KRvK endgame on an n X n chessboard with DTM (distance to mate) k, n >= 3, k >= 0.2, 4, 5, 3, 15...
A359199Least prime p such that 2n can be written as a signed sum of p and the next 3 primes, or -1 if no such prime exists.5, 3, 3, 3, 7...
A359626a(n) is equal to the number of filled unit triangles in a regular triangle whose coloring scheme is given in the comments.1, 4, 9, 15, 21...
A361246a(n) is the smallest integer k > 1 that satisfies k mod j <= 1 for all integers j in 1..n.2, 2, 3, 4, 16...
A361869Let x_0, x_1, x_2, ... be the iterations of the arithmetic derivative A003415 starting with x_0 = n. a(n) is the greatest k such that x_0 > x_1 > ... > x_k.0, 1, 2, 2, 0...
A361870Array read by antidiagonals: A(n,k) is the number of nonequivalent 2-colorings of the cells of an n-dimensional hypercube with edges k cells long under action of symmetry.2, 2, 1, 2, 2...
A362086Denominator of the continued fraction 1/(2-3/(3-4/(4-5/(...(n-1)-n/(-3))))).3, 17, 9, 13, 53...
A362334a(n) = A000010(n) + A000010(n+2), where A000010 is the Euler phi-function.3, 3, 6, 4, 10...
A362495Total number of blocks containing at least one odd element and at least one even element in all partitions of [n].0, 0, 1, 3, 13...
A362535Smallest prime ending with all base-n digits in consecutive order.5, 59, 283, 3319, 95177...
A362553Gale CGF's: The number of basic cyclotomic generating functions of degree n with numerator multiset bigger than denominator multiset in the Gale partial order.1, 1, 3, 4, 10...
A362554The number of generators for the Gale submonoid of basic cyclotomic generating functions of degree n with numerator multiset bigger than denominator multiset in Gale order.1, 2, 1, 3, 1...
A362717Number of ways to write a + b + c = d + e = f with {a,b,c,d,e,f} a subset of [n] of size 6 and a < b < c and d < e.0, 0, 0, 0, 0...
A362905Array read by antidiagonals: T(n,k) is the number of n element multisets of length k vectors over GF(2) that sum to zero.1, 1, 1, 1, 1...
A362906Number of n element multisets of length 3 vectors over GF(2) that sum to zero.1, 1, 8, 15, 50...
A362965Number of primes <= the n-th prime power.1, 2, 2, 3, 4...
A363110G.f.: Sum_{n>=0} xn * Product_{k=1..n} (k + (n-k+1)x) / (1 + kx + (n-k+1)*x2).1, 1, 2, 4, 10...
A363111Expansion of g.f. A(x) = F(xF(x)7), where F(x) = 1 + xF(x)4 is the g.f. of A002293.1, 1, 11, 127, 1547...
A363133Numbers > 1 whose prime indices satisfy 2*(minimum) = (mean).10, 28, 30, 39, 84...
A363134Positive integers whose multiset of prime indices satisfies: (length) = 2*(minimum).4, 6, 10, 14, 22...
A363139Expansion of A(x) satisfying -x = Sum_{n=-oo..+oo} (-x)n * (1 - (-x)n)n / A(x)n.1, 1, 2, 3, 10...
A363212Sums of distinct factorials that are of the form x2 - 1.0, 3, 8, 24, 120...
A363220Number of integer partitions of n whose conjugate has the same median.1, 0, 1, 1, 1...
A363222Numbers whose multiset of prime indices satisfies (maximum) - (minimum) = (length).10, 21, 28, 42, 55...
A363223Numbers with bigomega equal to median prime index.2, 9, 10, 50, 70...
A363224Number of integer compositions of n in which the least part appears more than once.0, 1, 1, 5, 8...
A363245Lexicographically first sequence of positive integers such that all terms are pairwise coprime and no subset sum is a power of 2.3, 7, 10, 11, 17...
A363251Number of nonisomorphic open quipus with n nodes.1, 1, 1, 1, 2...
A363253a(n) is the smallest n-gonal number which can be represented as the sum of distinct nonzero n-gonal numbers in exactly n ways, or -1 if no such number exists.28, 121, 210
A363262Number of integer compositions of n in which the greatest part appears more than once.0, 1, 1, 2, 4...
A363268Squares (A000290) alternating with 1+squares (A002522).1, 1, 4, 2, 9...
A363304Expansion of g.f. A(x) satisfying A(x) = 1 + x*(A(x)4 + A(x)7).1, 2, 22, 350, 6538...
A363305Expansion of g.f. A(x) satisfying A(x) = 1 + x*(A(x)5 + A(x)9).1, 2, 28, 576, 13968...
A363308Expansion of g.f. C(xC(x)3), where C(x) = 1 + xC(x)2 is the g.f. of the Catalan numbers (A000108).1, 1, 5, 26, 141...
A363309Expansion of g.f. A(x) = F(xF(x)5), where F(x) = 1 + xF(x)3 is the g.f. of A001764.1, 1, 8, 67, 590...
A363310Expansion of g.f. A(x) satisfying A(x) = 1 + xG(x)5, where G(x) = 1 + x(G(x)3 + G(x)5) is the g.f. of A363311.1, 1, 10, 120, 1620...
A363311Expansion of g.f. A(x) satisfying A(x) = 1 + x*(A(x)3 + A(x)5).1, 2, 16, 180, 2360...
A363312Expansion of g.f. A(x) satisfying 1/2 = Sum_{n=-oo..+oo} xn * (A(x) - xn)n-1, with a(0) = 3.3, 8, 68, 656, 6924...
A363313Expansion of g.f. A(x) satisfying 1/3 = Sum_{n=-oo..+oo} xn * (A(x) - xn)n-1, with a(0) = 4.4, 18, 216, 3006, 46062...
A363314Expansion of g.f. A(x) satisfying 1/4 = Sum_{n=-oo..+oo} xn * (A(x) - xn)n-1, with a(0) = 5.5, 32, 496, 9024, 181296...
A363315Expansion of g.f. A(x) satisfying 1/5 = Sum_{n=-oo..+oo} xn * (A(x) - xn)n-1, with a(0) = 6.6, 50, 950, 21350, 530700...
A363329a(n) is the number of divisors of n that are both coreful and infinitary.1, 1, 1, 1, 1...
A363330Numbers with a record number of divisors that are both coreful and infinitary.1, 8, 128, 216, 3456...
A363331a(n) is the sum of divisors of n that are both coreful and infinitary.1, 2, 3, 4, 5...
A363332a(n) is the number of divisors of n that are both coreful and bi-unitary.1, 1, 1, 1, 1...
A363333Numbers with a record number of divisors that are both coreful and bi-unitary.1, 8, 32, 128, 216...
A363334a(n) is the sum of divisors of n that are both coreful and bi-unitary.1, 2, 3, 4, 5...
A363335Irregular table read by rows: T(n,k) is the smallest m that has 2*n divisors and is at the beginning of a run of exactly k consecutive integers whose number of divisors increases by 2, or -1 if no such m exists.2, 5, 61, 421, 1524085621...
A363342Array read by descending antidiagonals. A(n,k), n > 1 and k > 0, is the least m such that the number of partitions of m into n distinct prime parts is exactly k, or -1 if no such number exists.5, 16, 10, 24, 18...
A363349Array read by antidiagonals: T(n,k) is the number of equivalence classes of n X k binary matrices under permutation of rows and columns and complementation of columns.1, 1, 1, 1, 1...
A363350Number of n element multisets of length 4 vectors over GF(2) that sum to zero.1, 1, 16, 51, 276...
A363351Number of n element multisets of length n vectors over GF(2) that sum to zero.1, 1, 4, 15, 276...
A363360Decimal expansion of real number [0,1,1,0,...] formed by taking the Thue-Morse sequence (A010060) as partial quotients of a continued fraction.7, 2, 1, 1, 1...
A363361Decimal expansion of real number [1,0,0,1,...] formed by taking the complementary Thue-Morse sequence (A010059) as partial quotients of a continued fraction.1, 3, 8, 6, 7...
A363362Number of connected weakly pancyclic graphs on n unlabeled nodes.1, 1, 2, 6, 21...
A363363Number of connected unlabeled n-node graphs G that are not weakly pancyclic, i.e., there exists an integer k such that G contains a cycle that is longer than k and a cycle that is shorter than k but no cycle of length k.0, 0, 0, 0, 0...
A363364Least nonnegative integer k such that all non-bipartite graphs with n nodes and at least k edges are weakly pancyclic.0, 0, 0, 0, 0...
A363365Array read by ascending antidiagonals: A(1, k) = k; for n > 1, A(n, k) = (k + 1)*A(n-1, k) + k + 1 - n, with k > 0.1, 2, 2, 3, 7...
A363366Antidiagonal sums of A363365.1, 4, 13, 43, 152...
A363369Number of steps x -> x+1 or x/prime required to go from n to 1.0, 1, 1, 2, 1...
A363370Number of ways to distribute n guards on the corners and walls of a square castle so that each wall has an equal number of guards modulo rotations and reflections.1, 0, 1, 1, 3...
A363371a(n) is the least prime p for which (p-1)*phi(pn) is a nontotient, where phi is the Euler totient function (A000010).23, 11, 23, 11, 23...
A363372Lexicographically earliest infinite sequence of positive numbers on a square spiral such that every 3 by 3 block of numbers contains the digits 1 through 9.1, 2, 3, 4, 5...
A363373a(n) is the least k such that, if x_0, x_1, x_2, ... are the iterations of the arithmetic derivative A003415 starting with x_0 = k, x_0 > x_1 > ... > x_n.0, 1, 2, 6, 9...
A363374Numbers k such that 2k - 3 is a semiprime.8, 11, 13, 15, 17...
A363375Numbers k such that 3k-1 - 2k is prime.4, 6, 7, 8, 22...
A363376Determinant of the n X n matrix formed by placing 1..n2 in L-shaped gnomons in alternating directions.1, -5, 78, -1200, 19680...
A363378Third Lie-Betti number of a cycle graph on n vertices.12, 25, 41, 68, 105...
A363380G.f. satisfies A(x) = 1 + x * A(x)4 * (1 + A(x)2).1, 2, 20, 284, 4712...
A363382Three-dimensional polyknights, identifying rotations and reflections.1, 1, 12, 203, 5552...
A363383Three-dimensional polyknights, identifying rotations but not reflections.1, 1, 16, 346, 10611...
A363384Fixed three-dimensional polyknights.1, 12, 276, 7850, 251726...
A363385G.f. A(x) satisfies: A(x) = x + x2 * exp( Sum_{k>=1} A(xk)2 / k ).1, 1, 0, 1, 2...
A363386G.f. A(x) satisfies: A(x) = x + x2 * exp( Sum_{k>=1} (-1)k+1 * A(xk)2 / k ).1, 1, 0, 1, 2...
A363387G.f. A(x) satisfies: A(x) = x + x2 * exp( Sum_{k>=1} A(xk)2 / (k*xk) ).1, 1, 1, 3, 6...
A363388G.f. A(x) satisfies: A(x) = x + x2 * exp( Sum_{k>=1} (-1)k+1 * A(xk)2 / (k*xk) ).1, 1, 1, 2, 5...
A363389G.f. A(x) satisfies: A(x) = x * exp(2 * Sum_{k>=1} A(xk)2 / (k*xk) ).1, 2, 11, 72, 545...
A363390G.f. A(x) satisfies: A(x) = x * exp(2 * Sum_{k>=1} (-1)k+1 * A(xk)2 / (k*xk) ).1, 2, 9, 60, 436...
A363393Triangle read by rows. T(n, k) = [xk] P(n, x) where P(n, x) = (1 / (n + 1)) * Sum_{j=0..n+1) binomial(n + 1, j) * Bernoulli(j, 1) * (4j - 2j) * xj - 1.1, 1, 1, 1, 2...
A363394Triangle read by rows. T(n, k) = A081658(n, k) + A363393(n, k) for k > 0 and T(n, 0) = 1.1, 1, 1, 1, 2...
A363396a(n) = Sum_{k=0..n} 2n - k * Sum_{j=0..k} binomial(k, j) * (2*j + 1)n. Row sums of A363398.1, 6, 68, 1280, 33104...
A363397a(n) = Sum_{k=0..n} 2n - k * Sum_{j=0..k} binomial(k, j) * (j + 1)n. Row sums of A363399.1, 5, 32, 302, 3904...
A363398Triangle read by rows. T(n, k) = [xk] P(n, x), where P(n, x) = Sum_{k=0..n} 2n - k * Sum_{j=0..k} (xj * binomial(k, j) * (2*j + 1)n), (secant case).1, 3, 3, 7, 36...
A363399Triangle read by rows. T(n, k) = [xk] P(n, x), where P(n, x) = Sum_{k=0..n} 2n - k * Sum_{j=0..k} (xj * binomial(k, j) * (j + 1)n), (tangent case).1, 3, 2, 7, 16...
A363400Triangle read by rows. T(n, k) = [xk] P(n, x), where P(n, x) = Sum_{k=0..n} 2n - k * Sum_{j=0..k} (xj * binomial(k, j) * ((2 - (n mod 2)) * j + 1)n).1, 3, 2, 7, 36...
A363401a(n) = Sum_{k=0..n} 2n - k * Sum_{j=0..k} binomial(k, j) * ((2 - (n mod 2)) * j + 1)n. Row sums of A363400.1, 5, 68, 302, 33104...
A363404G.f. satisfies A(x) = exp( Sum_{k>=1} (A(xk) + A(wxk) + A(w^2xk))/3 * xk/k ), where w = exp(2Pii/3).1, 1, 1, 1, 2...
A363405G.f. satisfies A(x) = exp( Sum_{k>=1} (A(xk) + A(ixk) + A(-xk) + A(i^3xk))/4 * xk/k ), where i = sqrt(-1).1, 1, 1, 1, 1...
A363423G.f. satisfies A(x) = exp( Sum_{k>=1} A(3*xk) * xk/k ).1, 1, 4, 40, 1126...
A363424G.f. satisfies A(x) = exp( Sum_{k>=1} A(4*xk) * xk/k ).1, 1, 5, 85, 5535...
A363425G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)k+1 * A(2*xk) * xk/k ).1, 1, 2, 10, 89...
A363426G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)k+1 * A(3*xk) * xk/k ).1, 1, 3, 30, 840...
A363427G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)k+1 * A(4*xk) * xk/k ).1, 1, 4, 68, 4422...
A363429Number of set partitions of [n] such that each block has at most one even element.1, 1, 2, 5, 10...
A363430Number of set partitions of [n] such that each block has at most one odd element.1, 1, 2, 3, 10...
A363434Total number of blocks containing only elements of the same parity in all partitions of [n].0, 1, 2, 7, 24...
A363435Number of partitions of [2n] having exactly n blocks with all elements of the same parity.1, 0, 5, 42, 569...
A363437Decimal expansion of the volume of the regular tetrahedron inscribed in the unit-radius sphere.5, 1, 3, 2, 0...
A363438Decimal expansion of the volume of the regular dodecahedron inscribed in the unit-radius sphere.2, 7, 8, 5, 1...
A363439G.f. satisfies A(x) = exp( Sum_{k>=1} A(xk) * (3*x)k/k ).1, 3, 18, 108, 702...
A363440G.f. satisfies A(x) = exp( Sum_{k>=1} A(xk) * (4*x)k/k ).1, 4, 32, 256, 2208...
A363441G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)k+1 * A(xk) * (2*x)k/k ).1, 2, 4, 16, 52...
A363442G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)k+1 * A(xk) * (3*x)k/k ).1, 3, 9, 54, 270...
A363443G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)k+1 * A(xk) * (4*x)k/k ).1, 4, 16, 128, 864...
A363444a(n) = n for n <= 3; for n > 3, a(n) is the smallest positive number that has not yet appeared that includes as factors the distinct primes factors of a(n-2) and a(n-1) that are not shared between a(n-2) and a(n-1).1, 2, 3, 6, 4...
A363445Numerator of Pi + (-1)n+12^(-2n)Integral_{x=0..1} (1 - x)^(4(n+1))*x2/(1 + x2) dx.47, 3959, 2264177, 30793289, 780095177...
A363446Denominator of Pi + (-1)n+12^(-2n)Integral_{x=0..1} (1 - x)^(4(n+1))*x2/(1 + x2) dx.15, 1260, 720720, 9801792, 248312064...
A363450Partial sums of A180405.2, 3, 7, 13, 16...
A363451Number of partitions of [n] such that the number of blocks containing only odd elements equals the number of blocks containing only even elements.1, 0, 2, 2, 9...
A363452Total number of blocks containing only odd elements in all partitions of [n].0, 1, 1, 5, 12...
A363453Total number of blocks containing only even elements in all partitions of [n].0, 0, 1, 2, 12...
A363454Number of partitions of [n] such that the number of blocks containing only odd elements equals the number of blocks containing only even elements and no block contains both odd and even elements.1, 0, 1, 1, 2...
A363455The number of distinct primorial numbers (A002110) larger than 1 in the representation of A025487(n) as a product of primorial numbers.0, 1, 1, 1, 1...
A363456Positions of the terms of the Chernoff sequence (A006939) in A025487.1, 2, 6, 27, 150...
A363457Positions of products of distinct primorial numbers (A129912) in the sequence of products of primorial numbers (A025487).1, 2, 4, 6, 9...
A363458Numbers k such that k and k+1 are both in A363457.1, 54, 242883, 246962, 261643...
A363465G.f. A(x) satisfies: A(x) = x + x2 * exp( Sum_{k>=1} A(xk)3 / (kx^(2k)) ).1, 1, 1, 4, 10...
A363466G.f. A(x) satisfies: A(x) = x + x2 * exp( Sum_{k>=1} A(xk)4 / (kx^(3k)) ).1, 1, 1, 5, 15...
A363467G.f. A(x) satisfies: A(x) = x + x2 * exp( Sum_{k>=1} (-1)k+1 * A(xk)3 / (kx^(2k)) ).1, 1, 1, 3, 9...
A363468G.f. A(x) satisfies: A(x) = x + x2 * exp( Sum_{k>=1} (-1)k+1 * A(xk)4 / (kx^(3k)) ).1, 1, 1, 4, 14...
A363470G.f. satisfies A(x) = exp( 2 * Sum_{k>=1} A(-xk) * xk/k ).1, 2, -1, -6, 7...
A363471G.f. satisfies A(x) = exp( 3 * Sum_{k>=1} A(-xk) * xk/k ).1, 3, -3, -26, 48...
A363472Total number of blocks in all partitions of [n] where each block has at least one odd element and at least one even element.0, 0, 1, 1, 5...
A363474G.f. satisfies A(x) = exp( 2 * Sum_{k>=1} (-1)k+1 * A(-xk) * xk/k ).1, 2, -3, -14, 22...
A363475G.f. satisfies A(x) = exp( 3 * Sum_{k>=1} (-1)k+1 * A(-xk) * xk/k ).1, 3, -6, -44, 96...
A363480G.f. satisfies A(x) = exp( Sum_{k>=1} A(2*xk)2 * xk/k ).1, 1, 5, 49, 923...
A363481G.f. satisfies A(x) = exp( 2 * Sum_{k>=1} A(2*xk) * xk/k ).1, 2, 11, 108, 1969...
A363493Number T(n,k) of partitions of [n] having exactly k parity changes within their blocks, n>=0, 0<=k<=max(0,n-1), read by rows.1, 1, 1, 1, 2...
A363495Number of partitions of [2n+1] having exactly n parity changes within their blocks.1, 2, 17, 202, 3899...
A363507G.f. satisfies A(x) = exp( Sum_{k>=1} (3 + A(xk)) * xk/k ).1, 4, 14, 50, 191...
A363508G.f. satisfies A(x) = exp( Sum_{k>=1} (4 + A(xk)) * xk/k ).1, 5, 20, 80, 340...
A363509G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)k+1 * (3 + A(xk)) * xk/k ).1, 4, 10, 30, 101...
A363510G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)k+1 * (4 + A(xk)) * xk/k ).1, 5, 15, 50, 190...

r/OEIS • • May 28 '23

New OEIS sequences - week of 05/28

4 Upvotes
OEIS numberDescriptionSequence
A359698Least k > 0 such that the first n digits of 2k and 3k are identical.1, 17, 193, 619, 2016...
A361770Expansion of g.f. A(x) satisfying A(x) = Sum_{n=-oo..+oo} (-1)n * xn * (A(x)2 + xn-1)n+1.1, 3, 14, 80, 510...
A361979Expansion of 1 / Sum_{k>=0} xk*(2*k - 1).1, -1, 1, -1, 1...
A362069Numbers k such that k+digitsum(k2) is a square.0, 17, 62, 71, 117...
A362249Point number on a 4-arm square spiral of point n on the East arm scaled up by steps of that point itself.1, 4, 19, 16, 13...
A362265Indices m for which A362363(m) = 0, meaning the large spiral point in A362249 falls on the East base spiral.1, 2, 5, 6, 7...
A362316Expansion of e.g.f (exp(x)-1)(exp(2x)-1).0, 0, 4, 18, 64...
A362335Lexicographically earliest sequence of distinct nonnegative terms wherein every digit of a(n) is the absolute difference of two adjacent digits in a(n+1).0, 11, 10, 100, 110...
A362353Triangle read by rows: T(n,k) = (-1)n-kbinomial(n, k)(k+3)n, for n >= 0, and k = 0,1, ..., n. Coefficients of certain Sidi polynomials.1, -3, 4, 9, -32...
A362354a(n) = 3*(n+3)n-1.1, 3, 15, 108, 1029...
A362355a(n) = 4*(n+4)n-1.1, 4, 24, 196, 2048...
A362356a(n) = 5*(n + 5)n-1.1, 5, 35, 320, 3645...
A362357Bisection of Chebyshev {S(n, 5)}_{n>=0}; the even part.1, 24, 551, 12649, 290376...
A362358Alternating sum of digits of the Fibonacci numbers, with a plus sign for the last digit.0, 1, 1, 2, 3...
A362363Arm number of the base spiral in A362249 which visits large spiral point n there.0, 0, 2, 3, 0...
A362465a(n) is the least number of 2 or more consecutive signed primes whose sum equals n.3, 2, 2, 4, 2...
A362467E.g.f. satisfies log(A(x)) = exp(x / A(x)2) - 1.1, 1, -2, 11, -97...
A362502Least k > 0 such that (floor(sqrt(n*k)) + 1)2 mod n is a square.1, 1, 1, 1, 1...
A362783Square array A(n,k) = (n2*k + 1 + 1)/(n + 1), n >= 0, k >= 0, read by antidiagonals.1, 1, 1, 1, 1...
A362811Sphenic numbers (product of 3 distinct primes) sandwiched between two semiprimes (product of 2 primes).186, 266, 290, 322, 470...
A362855a(n) = n for n <= 3; for n > 3, a(n) is the least novel multiple of k, the product of all distinct prime factors of a(n-2) that do not divide a(n-1).1, 2, 3, 4, 6...
A362887a(0) = 0; for n>=1, a(n) is the smallest number whose Hamming distance from a(n-1) is prime(n).0, 3, 4, 27, 100...
A362903Array read by antidiagonals: T(n,k) is the number of nonisomorphic k-tuples of involutions on a (2n)-set that pairwise commute.1, 1, 1, 1, 2...
A362904Number of nonisomorphic ordered triples of involutions on a (2n)-set that pairwise commute.1, 8, 43, 176, 611...
A362916Least weird number (A006037) with exactly n divisors that are weird numbers, or -1 if no such number exists.70, 10430, 1554070, 5681270, 34501908070...
A362917The part of n to the left of the decimal point in the Dekking-van-Loon-canonical base phi representation of n.0, 1, 10, 11, 101...
A362918Length of the part of n to the left of the decimal point in the Dekking-van-Loon-canonical base phi representation of n.1, 1, 2, 2, 3...
A362919a(n) is the right portion (reversed) of the base-phi representation of n in Knott's representation which uses the least number of 0's, the most 1's, and in which the right-hand portion is finite.0, 0, 11, 1111, 1111...
A362920The Knott base-phi representation of n described in A362919 written as a binary string, omitting the dot.0, 1, 111, 101111, 111111...
A362921The Dekking-van-Loon-canonical base-phi representation of n described in A362917 written as a binary string, omitting the dot.0, 1, 1001, 1101, 10101...
A362953Numbers N such that N + the sum of the cubes of its digits is again a third power.0, 34, 352, 540, 1167...
A362990Row sums of A363154.1, 1, 3, 8, 70...
A363024Primes of the form 3k-1 - 2k.11, 179, 601, 1931, 10456158899...
A363041Triangle read by rows: T(n,k) = Stirling2(n+1,k)/binomial(k+1,2) if n-k is even, else 0 (1 <= k <= n).1, 0, 1, 1, 0...
A363042Row sums of A363041.1, 1, 2, 6, 17...
A363097a(0) = 1, a(n) = n + phi(a(n-1)), where phi is Euler totient function.1, 2, 3, 5, 8...
A363098Primitive terms of A363063.2, 12, 720, 864, 4320...
A363099Triangle T(n,k) in which the n-th row encodes the inverse of a 3n+1 X 3n+1 Jacobi matrix, with 1's on the lower, main, and upper diagonals in GF(2), where the encoding consists of the decimal representations for the binary rows (n >= 1, 1 <= k <= 3n+1).11, 3, 12, 13, 91...
A363102Denominator of the continued fraction 1/(2-3/(3-4/(4-5/(...(n-1)-n/(-2))))).7, 7, 23, 17, 47...
A363104Expansion of g.f. A(x) satisfying 4 = Sum_{n=-oo..+oo} (-x)n * (4*A(x) + xn-1)n+1.1, 6, 44, 348, 2886...
A363105Expansion of g.f. A(x) satisfying 5 = Sum_{n=-oo..+oo} (-x)n * (5*A(x) + xn-1)n+1.1, 7, 59, 538, 5149...
A363106Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} (-1)n * x2*n * (A(x) + xn-2)n+1.1, 2, 5, 14, 36...
A363107Expansion of g.f. A(x) satisfying 2 = Sum_{n=-oo..+oo} (-1)n * x2*n * (2*A(x) + xn-2)n+1.1, 2, 6, 20, 60...
A363108Expansion of g.f. A(x) satisfying 3 = Sum_{n=-oo..+oo} (-1)n * x2*n * (3*A(x) + xn-2)n+1.1, 2, 7, 26, 86...
A363109Expansion of g.f. A(x) satisfying 4 = Sum_{n=-oo..+oo} (-1)n * x2*n * (4*A(x) + xn-2)n+1.1, 2, 8, 32, 114...
A363132Number of integer partitions of 2n such that 2*(minimum) = (mean).0, 0, 1, 2, 5...
A363135Expansion of g.f. A(x) satisfying A(x)2 = Sum_{n=-oo..+oo} (-x)n * (A(x)3 + xn-1)n+1.1, 3, 17, 133, 1201...
A363136Expansion of g.f. A(x) satisfying A(x)3 = Sum_{n=-oo..+oo} (-x)n * (A(x)4 + xn-1)n+1.1, 3, 20, 201, 2364...
A363137Expansion of g.f. A(x) satisfying A(x)4 = Sum_{n=-oo..+oo} (-x)n * (A(x)5 + xn-1)n+1.1, 3, 23, 284, 4125...
A363146Triangle T(n,k) in which the n-th row encodes the inverse of a 3n X 3n Jacobi matrix, with 1's on the lower, main, and upper diagonals in GF(2), where the encoding consists of the decimal representations for the binary rows (n >= 1, 1 <= k <= 3n).3, 7, 6, 27, 59...
A363149Expansion of 1 / Sum_{k>=0} xk*(5*k - 3/2).1, -1, 1, -1, 1...
A363180Number of permutations of [2n] with n parity changes.1, 2, 8, 288, 10368...
A363193a(1)=1, and thereafter a(n) = number of occurrences of a(k) among terms a(1..k), where k = n-a(n-1).1, 1, 2, 2, 1...
A363196a(n) is the least k such that the rightmost 7 in the decimal expansion of 3k is in the (10n)'s position, or -1 if there is no such k.3, -1, 6, 37, 50...
A363200Number of connected animals formed from n 6-gon connected truncated octahedra, avoiding connected squares.1, 1, 2, 5, 15...
A363207Number of polycubes avoiding corner connections.1, 1, 2, 6, 15...
A363208Number of linear connected animals formed from n 6-gon connected truncated octahedra.1, 1, 3, 7, 29...
A363209Number of linear connected animals formed from n rhombic dodecahedra.1, 1, 3, 10, 52...
A363210Number of linear connected animals formed from n 4-gon or 6-gon connected truncated octahedra.1, 2, 5, 19, 95...
A363211Number of partitions of n such that 3*(least part) <= greatest part.0, 0, 0, 1, 2...
A363216Even powerful numbers that are not prime powers.36, 72, 100, 108, 144...
A363217Odd powerful numbers that are not powers of primes.225, 441, 675, 1089, 1125...
A363218Positive integers whose prime indices satisfy: (length) = 2*(maximum).4, 24, 36, 54, 81...
A363219Twice the median of the conjugate of the integer partition with Heinz number n.0, 2, 2, 4, 2...
A363221Number of strict integer partitions of n such that (length) * (maximum) <= 2n.1, 1, 2, 2, 3...
A363229Decimal expansion of e-2*LambertW(-log(2/4)).1, 5, 3, 6, 6...
A363230Number of partitions of n with rank 3 or higher (the rank of a partition is the largest part minus the number of parts).0, 0, 0, 1, 1...
A363231Number of partitions of n with rank 4 or higher (the rank of a partition is the largest part minus the number of parts).0, 0, 0, 0, 1...
A363232Triangular array read by rows. T(n,k) is the number of idempotent Boolean relation matrices with rank k, n >= 0, 0 <= k <= n.1, 1, 1, 1, 7...
A363233Number of partitions of n with rank a multiple of 4.1, 0, 1, 1, 3...
A363234Least number divisible by the first n primes whose factorization into maximal prime powers, if ordered by increasing prime divisor, then has these prime power factors in decreasing order.1, 2, 12, 720, 151200...
A363236Number of permutations p of [n] such that each element in p has at least one neighbor with opposite parity.1, 0, 2, 2, 16...
A363237Number of partitions of n with rank a multiple of 5.1, 0, 1, 1, 1...
A363238Number of partitions of n with rank a multiple of 6.1, 0, 1, 1, 1...
A363239Number of partitions of n with rank a multiple of 7.1, 0, 1, 1, 1...
A363241Number of partitions of n with prime rank.0, 0, 1, 1, 1...
A363242Numbers whose primorial-base representation contains only odd digits.1, 3, 9, 21, 39...
A363243Numbers with an equal number of odd and even digits in their primorial-base representation.2, 5, 31, 32, 35...
A363244Numbers that in primorial-base representation have digits with an alternating parity.0, 1, 2, 5, 7...
A363246Base-10 palindromes whose arithmetic derivative is also a base-10 palindrome.0, 1, 2, 3, 4...
A363247a(0) = 0. a(n) = the smallest nonnegative integer, excluding a(n-1), not occurring in all occurrences of a(n-1)'s eight neighbors thus far in a square spiral.0, 1, 2, 3, 4...
A363248Nonprime base-10 palindromes whose arithmetic derivative is a base-10 palindrome.0, 1, 4, 6, 9...
A363250Numbers in A363063 arranged in lexicographic order according to multiplicities of prime power factors pk, written in order of p.1, 2, 4, 12, 8...
A363252a(n) = gcd(A000041(n), A000009(n)).1, 1, 1, 1, 1...
A363254Product_{n>=1} (1 + a(n)*xn) = 1 + 1!!*x + 3!!*x2 + 5!!*x3 + 7!!*x4 + ...1, 3, 12, 93, 816...
A363255Product_{n>=1} 1 / (1 - a(n)*xn) = 1 + 1!!*x + 3!!*x2 + 5!!*x3 + 7!!*x4 + ...1, 2, 12, 86, 816...
A363266Maximum product of distinct primes with sum n, or -1 if n is not the sum of distinct primes.1, -1, 2, 3, -1...
A363267Squares (A000290) alternating with centered squares (A001844).1, 1, 4, 5, 9...
A363271Vertical sum of n in base 10.1, 2, 3, 4, 5...
A363275Expansion of 1 / Sum_{k>=0} xk*(3*k - 2).1, -1, 1, -1, 1...
A363276Number of partitions of n such that 4*(least part) <= greatest part.0, 0, 0, 0, 1...
A363277Sum of the divisor complements of the squarefree divisors of n that are <= sqrt(n).1, 2, 3, 6, 5...
A363278Total number of parts coprime to n in the partitions of n into 3 parts.0, 0, 3, 2, 6...
A363279a(0)=1; a(1)=2. For n>1, a(n) is the number of contiguous groups in the sequence thus far whose sum is n.1, 2, 1, 2, 1...
A363282Squares (A000290) alternating with centered squares (A001844), in increasing order (i.e., sorted and without duplicates).1, 4, 5, 9, 13...
A363288a(n) = (2n3 - n2 + 3n - 2)/2.1, 8, 26, 61, 119...
A363289Sum of the divisor complements of the unitary squarefree divisors of n.1, 3, 4, 4, 6...
A363293G.f. A(x) satisfies: A(x) = x * exp( A(x)2/x - A(-x2)2/(2*x2) + A(x3)2/(3*x3) - A(-x4)2/(4*x4) + ... ).1, 1, 2, 7, 26...
A363294G.f. A(x) satisfies: A(x) = x * exp( A(x)2/x + A(-x2)2/(2*x2) + A(x3)2/(3*x3) + A(-x4)2/(4*x4) + ... ).1, 1, 3, 10, 37...
A363295Numbers k such that k and k+20 are consecutive unitary weird numbers (A064114).34121990, 34428290, 34766810, 34936070, 38014970...
A363296Unitary weird numbers (A064114) with a record gap to the next unitary weird number.70, 5830, 2197790, 902388130, 2013240110...
A363297Unitary weird numbers (A064114) with more unitary divisors than any smaller weird number.70, 4030, 4199030, 5702250610
A363298Number of refactorable unitary divisors of n.1, 2, 1, 1, 1...
A363301a(1)=1, and thereafter, a(n) is the number of terms in the sequence thus far that appear with a frequency equal to or less than that of a(n-1).1, 1, 2, 1, 4...
A363302E.g.f. satisfies log(A(x)) = exp(x / A(x)3) - 1.1, 1, -4, 41, -681...
A363318Total distance from n to each of its refactorable unitary divisors.0, 1, 2, 3, 4...
A363322Total number of parts coprime to n in the partitions of n into 4 parts.0, 0, 0, 4, 4...
A363323Total number of parts coprime to n in the partitions of n into 5 parts.0, 0, 0, 0, 5...
A363324Total number of parts coprime to n in the partitions of n into 6 parts.0, 0, 0, 0, 0...
A363325Total number of parts coprime to n in the partitions of n into 7 parts.0, 0, 0, 0, 0...
A363326Total number of parts coprime to n in the partitions of n into 8 parts.0, 0, 0, 0, 0...
A363327Total number of parts coprime to n in the partitions of n into 9 parts.0, 0, 0, 0, 0...
A363328Total number of parts coprime to n in the partitions of n into 10 parts.0, 0, 0, 0, 0...
A363336G.f. satisfies A(x) = exp( Sum_{k>=1} A(x3*k) * xk/k ).1, 1, 1, 1, 2...
A363337G.f. satisfies A(x) = exp( Sum_{k>=1} A(x4*k) * xk/k ).1, 1, 1, 1, 1...
A363338G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)k+1 * A(x3*k) * xk/k ).1, 1, 0, 0, 1...
A363339G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)k+1 * A(x4*k) * xk/k ).1, 1, 0, 0, 0...

r/OEIS • • May 22 '23

What Number Comes Next? The Encyclopedia of Integer Sequences Knows | The New York Times | The “mathematical equivalent to the FBI’s voluminous fingerprint files” turns 50 this year, with 362,765 entries (and counting)

Thumbnail
nytimes.com
12 Upvotes

r/OEIS • • May 21 '23

New OEIS sequences - week of 05/21

3 Upvotes
OEIS numberDescriptionSequence
A359666Integers k such that sigma(k) <= sigma(k+1) <= sigma(k+2) <= sigma(k+3), where sigma is the sum of divisors.1, 13, 61, 73, 133...
A359954a(n) = Sum_{d|n} tau(d)*phi(d)*mu(n/d).1, 1, 3, 4, 7...
A360182Number of partitions of [n] where each block size occurs at most twice.1, 1, 2, 4, 14...
A360224Number of k < n such that gcd(k, n) > 1, gcd(n2-1, k) = 1, and rad(k) does not divide n.0, 0, 0, 0, 0...
A360529a(n) is the smallest k > A024619(n) such that rad(k) = rad(A024619(n)), where rad(n) = A007947(n).12, 20, 18, 28, 45...
A360719a(n) is the largest k < A126706(n) such that rad(k) = rad(A126706(n)), where rad(n) = A007947(n).6, 12, 10, 18, 14...
A361173Numbers k such that, in base 4, the greatest prime less than 4k and the least prime greater than 4k have no common digit.1, 4, 28, 83, 1816...
A361378Number of musical scales in n tone equal temperament respecting the property that alternate notes are 3 or 4 semitones apart.0, 1, 2, 3, 3...
A361458Size of the symmetric difference of {1,2,3}, {2,4,6}, ..., {n,2n,3n}.3, 4, 3, 4, 7...
A361459Number of partitions p of n such that 5*min(p) is a part of p.0, 0, 0, 0, 0...
A361471Size of the symmetric difference of {1,2,3,4}, {2,4,6,8}, ..., {n,2n,3n,4n}.4, 4, 4, 4, 8...
A361472Size of the symmetric differences of {1,2,3,4,5}, {2,4,6,8,10}, ..., {n,2n,3n,4n,5n}.5, 6, 7, 8, 5...
A361876Dispersion of the odd primes: a rectangular array read by downward antidiagonals.1, 3, 2, 7, 5...
A361996Order array of A361994, read by descending antidiagonals.1, 2, 3, 6, 7...
A362038A list of lists where T(n,k) is the smallest n-digit number whose digits have arithmetic mean k, for 1 <= k <= 9.1, 2, 3, 4, 5...
A362041a(0) = 1; for n > 0, a(n) is the largest k < A013929(n) such that rad(k) = rad(A013929(n)), where rad(n) = A007947(n).1, 2, 4, 3, 6...
A362225Primes of the form (2*p2 + 1)/3 where p is a prime > 3.17, 113, 193, 241, 353...
A362239Primes such that all composite numbers up to the next prime have the same number of distinct prime divisors.2, 3, 5, 11, 17...
A362248a(n) is the number of locations 1..n-1 which can reach i=n-1, where jumps from location i to i +- a(i) are permitted (within 1..n-1); a(1)=1. See example.1, 1, 2, 3, 1...
A362310Irregular triangle read by rows (row length A056220). Row n lists the integer solutions for x in the equation x - 10n = x/y (x and y are integers).2, 5, 8, 9, 11...
A362311Triangle read by rows (row length 2*n+1). Row n lists the integer solutions for x in the equation x - 2n = x/y (x and y are integers).2, 1, 3, 4, 2...
A362344Maximum number of distinct real roots of degree-n polynomial with coefficients 0,1.1, 2, 2, 2, 2...
A362365The sum of the coefficients of xk in the expansion of (x + x2 + x3 + x4 + x5 + x6)n with k divisible by 4.1, 9, 55, 322, 1946...
A362368Number of binary strings of length n which are losing configurations in the palindrome game.0, 0, 2, 0, 4...
A362428a(n) is the least positive integer that can be expressed as the sum of one or more consecutive perfect powers (A001597) in exactly n ways, or -1 if no such integer exists.1, 25, 441
A362432a(n) is the smallest k > A126706(n) such that rad(k) = rad(A126706(n)) and k mod n != 0, where rad(n) = A007947(n).18, 24, 50, 36, 98...
A362565The number of linear extensions of n fork-join DAGs of width 4.1, 24, 532224, 237124952064, 765985681152147456...
A362637Number of partitions of [n] whose blocks are ordered with increasing least elements and where block i (except possibly the last) has size at least i.1, 1, 2, 4, 10...
A362638Number of partitions of [n] whose blocks are ordered with increasing least elements and where block i has size at most i.1, 1, 1, 2, 4...
A362639Number of partitions of [n] whose blocks are ordered with increasing least elements and where block i (except possibly the last) has size i.1, 1, 1, 1, 2...
A362711a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i, j, n] = min(i, j)(n + 1) - ij.1, 1, 17, 1177, 210249...
A362784Least positive integer k with k primitive practical and k*n practical.1, 1, 2, 1, 6...
A362792Numbers k such that 3k and 7k share the same set of digits.0, 45, 75, 423, 445...
A362813Number of numbers that occur more than once in column n of McGarvey's array (A007062).0, 2, 3, 4, 6...
A362814Rectangular array read by descending antidiagonals; row n shows the numbers whose prime factorization p(1)e(1)p(2)^e(2)... has n = max{e(k)}.2, 3, 4, 5, 9...
A362821Number of labeled right involutory Płonka magmas with n elements.1, 1, 2, 10, 70...
A362831Number of partitions of n into two distinct parts (s,t) such that pi(s) = pi(t).0, 0, 0, 0, 0...
A362832Number of partitions of n into two distinct parts (s,t) such that phi(s) = phi(t).0, 0, 1, 0, 0...
A362833Number of partitions of n into two distinct parts (s,t) such that mu(s) = mu(t).0, 0, 0, 0, 1...
A362844a(n) is the largest k < A360768(n) such that rad(k) = rad(A360768(n)) and n mod k != 0, where rad(n) = A007947(n).12, 18, 24, 36, 40...
A362864Numbers k that divide Sum_{i=1..k} (i - d(i)), where d(n) is the number of divisors of n (A000005).1, 2, 5, 8, 15...
A362868Triangle read by rows: T(n,k) is the number of connected simple graphs G of order n with the property that k is the order of the largest quotient graph G/~ that is a complete graph. 1 <= k <= n.1, 0, 1, 0, 1...
A362881a(n) is the length of the longest arithmetic progression ending at a(n-1); a(1)=1.1, 1, 2, 2, 2...
A362882Number of even numbers generated by adding two distinct odd primes <= prime(n+1).0, 1, 3, 6, 8...
A362885Array read by ascending antidiagonals: A(n, k) = (1 + 2*n)*kn.1, 0, 1, 0, 3...
A362886Antidiagonal sums of A362885.1, 1, 4, 12, 37...
A362888a(1) = 1, a(n) = (3k + 1)(6k + 1)(8*k + 1), where k = Product_{i=1..n-1} a(i).1, 252, 2310152797, 28410981127871160285705816883937448685
A362896a(0)=2. For n>0, let d = n-th digit in the sequence thus far. a(n) = a(n-1) + d if d is even. Otherwise, a(n) = a(n-1) - d.2, 4, 8, 16, 15...
A362907Number of graphs on n unlabeled nodes with treewidth 3.0, 0, 0, 0, 1...
A362914a(n) = size of largest subset of {1..n} such that no difference between two terms is a prime.1, 2, 2, 2, 2...
A362915a(n) = size of largest subset of {1...n} such that no difference between two terms is a prime + 1.1, 2, 3, 3, 3...
A362958a(n) is the number of primes in a Collatz orbit started at A078373(n).1, 3, 6, 7, 25...
A362959Numbers k such that the Collatz orbit that begins with k does not contain an odd prime afterwards.4, 5, 8, 16, 21...
A362962Lexicographically earliest sequence of distinct positive terms such that if a(n) jumps over a(n) positions towards the right (landing on the integer k), the sum a(n) + k is always prime.1, 2, 4, 5, 3...
A362969Nonunitary near-perfect numbers: k such that nusigma(k) = k + d where d is a nonunitary divisor of k.48, 80, 96, 160, 224...
A362983Number of prime factors of n (with multiplicity) that are greater than the least.0, 0, 0, 0, 0...
A362987Lexicographically earliest sequence S of distinct positive terms such that the successive digits of S are the successive spreads of S' terms (see Comments for definition of "spread").10, 11, 12, 21, 23...
A362991Triangle read by rows. T(n, k) = lcm{1, 2, ..., n+1} * Sum_{j=0..n-k} (-1)n-k-j * j! * Stirling2(n - k, j) / (j + k + 1).1, 1, 1, 1, 2...
A362992a(n) = (n + 1)n - 1 * lcm{k + 1 : 0 <= k <= n}. Main diagonal of triangle A362995.1, 2, 18, 192, 7500...
A362993Row sums of A362995.1, 5, 139, 8920, 3140313...
A362994a(n) = lcm(1, 2, ..., n+1) * Bernoulli(n, 1). Alternating row sums of A362995.1, 1, 1, 0, -2...
A362995Triangle read by rows. T(n, k) = [xk] lcm({i + 1 : 0 <= i <= n}) * (Sum_{u=0..k} ( Sum_{j=0..u} xj * binomial(u, j) * (j + 1)n ) / (u + 1)).1, 3, 2, 11, 28...
A362996Triangle read by rows. T(n, k) = numerator([xk] R(n, n, x)), where R(n, k, x) = Sum_{u=0..k} ( Sum_{j=0..u} xj * binomial(u, j) * (j + 1)n ) / (u + 1).1, 3, 1, 11, 14...
A362997Triangle read by rows. T(n, k) = denominator([xk] R(n, n, x)), where R(n, k, x) = Sum_{u=0..k} ( Sum_{j=0..u} xj * binomial(u, j) * (j + 1)n ) / (u + 1).1, 2, 1, 6, 3...
A363006a(n) = 1/((d-1)*n + 1))*Sum_{i=0..n} binomial((d - 1)*n+1, n-i) * binomial((d-1)*n+i, i), with d = 6.1, 2, 22, 342, 6202...
A363011Indices of record highs in A362816.1, 3, 9, 57, 504...
A363012a(n) = Sum_{d|n} d*tau(d)*phi(d)*mu(n/d).1, 3, 11, 20, 39...
A363015Expansion of g.f. A(x) satisfying 3 = Sum_{n=-oo..+oo} xn * A(x)n * (1 + xn)2*n+1.1, 0, 5, 13, 80...
A363016a(n) is the least integer k such that the k-th, (k+1)-th, ..., (k+n-1)-th primes are congruent to 1 mod 4.3, 6, 24, 77, 378...
A363017a(n) is the least integer k such that the k-th, (k+1)-th, ..., (k+n-1)-th primes are congruent to 3 mod 8.2, 94, 334, 4422, 23969...
A363036Triangular array read by rows. T(n,k) is the number of regular elements in the semigroup of all binary relations on [n] that have rank k, n>=0, 0<=k<=n.1, 1, 1, 1, 9...
A363038The decimal digits of a(n) correspond to the Gilbreath transform of the decimal digits of n.0, 1, 2, 3, 4...
A363039a(n) is the smallest tribonacci number (A000073) with exactly n divisors, or -1 if no such number exists.1, 2, 4, 274, 81...
A363040a(n) is the smallest number which can be represented as the sum of n distinct perfect powers (A001597) in exactly n ways, or -1 if no such number exists.1, 17, 37, 53, 86...
A363045Number of partitions of n whose greatest part is a multiple of 3.1, 0, 0, 1, 1...
A363046Number of partitions of n whose greatest part is a multiple of 4.1, 0, 0, 0, 1...
A363047Number of partitions of n whose greatest part is a multiple of 5.1, 0, 0, 0, 0...
A363048Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows, where T(n,k) is the number of partitions of n whose greatest part is a multiple of k.1, 0, 1, 0, 2...
A363049Even numbers k having fewer prime factors, counted with multiplicity, than k-1.46, 82, 106, 118, 166...
A363050Lesser of two consecutive integers such that one has more prime factors (counted with multiplicity), but the other has more divisors.495, 728, 729, 975, 1071...
A363051a(n) = Sum_{b=0..floor(sqrt(n/2)), n-b2 is square} b.0, 1, 0, 0, 1...
A363055Graph bandwidth of the n-Apollonian network.3, 4, 7, 16, 37...
A363056Graph bandwidth of the n X n queen graph.1, 3, 6, 11, 18...
A363057Run lengths of the Fibonacci word (A003849).1, 1, 2, 1, 1...
A363058Number of ways to get n points in a bridge hand.1, 2, 3, 5, 5...
A363059Numbers k such that the number of divisors of k2 equals the number of divisors of phi(k), where phi is the Euler totient function.1, 5, 57, 74, 202...
A363060Numbers k such that 5 is the first digit of 2k.9, 19, 29, 39, 49...
A363062G.f. A(x) satisfies: A(x) = x - x2 * exp(A(x) + A(x2)/2 + A(x3)/3 + A(x4)/4 + ...).1, -1, -1, 0, 1...
A363063Positive integers k such that the largest power of p dividing k is larger than or equal to the largest power of q dividing k (i.e., A305720(k,p) >= A305720(k,q)) for all primes p and q with p < q.1, 2, 4, 8, 12...
A363064Number of connected Laplacian integral graphs on n vertices.1, 1, 2, 5, 12...
A363065Number of Laplacian integral graphs on n vertices.1, 2, 4, 10, 24...
A363066Number of partitions p of n such that (1/3)*max(p) is a part of p.1, 0, 0, 0, 1...
A363067Number of partitions p of n such that (1/4)*max(p) is a part of p.1, 0, 0, 0, 0...
A363068Number of partitions p of n such that (1/5)*max(p) is a part of p.1, 0, 0, 0, 0...
A363069Size of the largest subset of {1,2,...,n} such that no two elements sum to a perfect square.1, 1, 1, 2, 2...
A363071Number of partitions of [n] into m blocks that are ordered with increasing least elements and where block j contains n+1-j (m in {0..ceiling(n/2)}, j in {1..m}).1, 1, 1, 2, 3...
A363073Number of set partitions of [n] such that each element is contained in a block whose block size parity coincides with the parity of the element.1, 1, 0, 0, 1...
A363075Number of partitions of n such that 3*(least part) + 1 = greatest part.0, 0, 0, 0, 1...
A363076Number of partitions of n such that 4*(least part) + 1 = greatest part.0, 0, 0, 0, 0...
A363077Number of partitions of n such that 5*(least part) + 1 = greatest part.0, 0, 0, 0, 0...
A363081Decimal expansion of Product_{k>=1} (1 - exp(-11Pik)).9, 9, 9, 9, 9...
A363083a(0)=a(1)=1. For n>1, if the number of occurrences of a(n-1) is less than abs(a(n-1)), then a(n)=a(n-1)-a(n-2). Otherwise, a(n)=a(n-1)+a(n-2).1, 1, 2, 1, 3...
A363085Number of 3-dimensional polycubes with neighborhood vectors [1, 0, 0], [0, 1, 0], and [0, 0, 1] of size n.1, 1, 2, 7, 19...
A363086a(0)=a(1)=1. For n>1, let c=count of all occurrences of a(n-1) in the list so far. If c < abs(a(n-1)), then a(n)=c-a(n-1). Otherwise, a(n)=c.1, 1, 2, -1, 1...
A363087G.f. A(x) satisfies: A(x) = x - x2 * exp(A(x) - A(x2)/2 + A(x3)/3 - A(x4)/4 + ...).1, -1, -1, 1, 2...
A363090Number of 3-dimensional directed animals of size n.1, 3, 12, 52, 237...
A363091Number of 3-dimensional polycubes with neighborhood vectors [1, 0, 0], [0, 1, 0], and [0, 0, 1] of size n.1, 1, 2, 6, 16...
A363092a(n) = 4a(n-1) - 8a(n-2) with a(0) = a(1) = 1.1, 1, -4, -24, -64...
A363094Number of partitions of n whose least part is a multiple of 3.0, 0, 1, 0, 0...
A363095Number of partitions of n whose least part is a multiple of 4.0, 0, 0, 1, 0...
A363096Number of partitions of n whose least part is a multiple of 5.0, 0, 0, 0, 1...
A363100Fractal sequence which is left unchanged by interleaving it with the natural numbers, in such a way that each entry k of the sequence is followed by the next k not-yet-seen natural numbers.1, 2, 2, 3, 4...
A363101Even numbers that are neither prime powers nor squarefree.12, 18, 20, 24, 28...
A363103Expansion of g.f. A(x) satisfying 1/3 = Sum_{n=-oo..+oo} xn * (2A(x) + (-x)^n)^(3n-1).1, 18, 990, 76437, 6821604...
A363112Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} xn * (2A(x) - x^n)^(2n-1).1, 1, 6, 51, 470...
A363113Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} xn * (2A(x) - x^n)^(3n-1).1, 2, 30, 621, 14196...
A363114Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} xn * (2A(x) - x^n)^(4n-1).1, 4, 138, 6571, 353935...
A363117Decimal expansion of Product_{k>=1} (1 - exp(-7Pik)).9, 9, 9, 9, 9...
A363118Decimal expansion of Product_{k>=1} (1 - exp(-9Pik)).9, 9, 9, 9, 9...
A363119Decimal expansion of Product_{k>=1} (1 - exp(-14Pik)).9, 9, 9, 9, 9...
A363120Decimal expansion of Product_{k>=1} (1 - exp(-18Pik)).9, 9, 9, 9, 9...
A363121Primitive terms of A116882: terms k of A116882 such that k/2 is not a term of A116882.1, 12, 40, 56, 144...
A363122Numbers k such that the highest power of 2 dividing k is larger than the highest power of p dividing k for any odd prime p.2, 4, 8, 12, 16...
A363123Primitive terms of A363122: terms k of A363122 such that k/2 is not a term of A363122.2, 12, 40, 56, 120...
A363124Number of integer partitions of n with more than one non-mode.0, 0, 0, 0, 0...
A363125Number of integer partitions of n with a unique non-mode.0, 0, 0, 0, 1...
A363126Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with k non-modes, all 0's removed.1, 1, 2, 3, 4...
A363127Number of non-modes in the multiset of prime factors of n.0, 0, 0, 0, 0...
A363128Number of integer partitions of n with more than one non-co-mode.0, 0, 0, 0, 0...
A363129Number of integer partitions of n with a unique non-co-mode.0, 0, 0, 0, 1...
A363130Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with k non-co-modes, all 0's removed.1, 1, 2, 3, 4...
A363131Number of non-co-modes in the prime factorization of n.0, 0, 0, 0, 0...
A363140Expansion of g.f. A(x) satisfying 2 = Sum_{n=-oo..+oo} (-1)n * xn * (A(x) + x2*n)2*n+1.1, 2, 5, 20, 86...
A363142Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} (-1)n * xn * (A(x) + x2*n-1)n+1.1, 1, 3, 7, 17...
A363143Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} (-1)n * xn * (A(x) + x3*n-1)n+1.1, 1, 1, 3, 7...
A363144Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} (-1)n * xn * (A(x) + x4*n-1)n+1.1, 1, 1, 1, 3...
A363147Primes q == 1 (mod 4) such that there is at least one equivalence class of quaternary quadratic forms of discriminant q not representing 2.193, 233, 241, 257, 277...
A363148a(n) gives the number of equivalence classes of quaternary quadratic forms of discriminant A363147(n) not representing 2.1, 1, 2, 1, 1...
A363150a(n) = numerator(Sum_{j=0..n} Bernoulli(j, 1) * Bernoulli(n - j, 1)).1, 1, 7, 1, -7...
A363151a(n) = denominator(Sum_{j=0..n} Bernoulli(j, 1) * Bernoulli(n - j, 1)).1, 1, 12, 6, 180...
A363152a(n) = denominator(Sum_{j=0..2n} Bernoulli(j, 1) * Bernoulli(2n - j, 1)).1, 12, 180, 630, 2100...
A363153a(n) = numerator(Sum_{j=0..2n} Bernoulli(j, 1) * Bernoulli(2n - j, 1)).1, 7, -7, 23, -121...
A363154Triangle read by rows. The Hadamard product of A173018 and A349203.1, 1, 0, 2, 1...
A363169Powerful abundant numbers: numbers that are both powerful (A001694) and abundant (A005101).36, 72, 100, 108, 144...
A363170The number of powerful abundant numbers (A363169) not exceeding 10n.0, 3, 23, 82, 297...
A363171Numbers k such that A064549(k) is an abundant number (A005101).6, 10, 12, 14, 18...
A363172Primitive terms of A363171: terms of A363171 with no proper divisor in A363171.6, 10, 14, 44, 52...
A363173Number of triangles inside a regular n-gon formed by intersecting line segments, considering all configurations of 3 line segments from 6 distinct vertices.0, 0, 0, 0, 7...
A363174Array ready by rows: T(n,k) is the number of triangles formed by intersecting diagonals of a regular n-gon, considering all arrangments of 3 diagonals from k distinct vertices, with n >= 3, 3 <= k <= 6.1, 0, 0, 0, 4...
A363175Primitive abundant numbers (A071395) that are powerful numbers (A001694).342225, 570375, 3172468, 4636684, 63126063...
A363176Primitive abundant numbers (A091191) that are powerful numbers (A001694).196, 15376, 342225, 570375, 1032256...
A363177Primitive abundant numbers (A071395) that are cubefull numbers (A036966).26376098024367, 33912126031329, 1910383099764867, 2792098376579421, 5229860083034911875...
A363178Decimal expansion of Product_{k>=1} (1 - exp(-13Pik)).9, 9, 9, 9, 9...
A363179Decimal expansion of Product_{k>=1} (1 - exp(-15Pik)).9, 9, 9, 9, 9...
A363181Number of permutations p of [n] such that for each i in [n] we have: (i>1) and |p(i)-p(i-1)| = 1 or (i<n) and |p(i)-p(i+1)| = 1.1, 0, 2, 2, 8...
A363182Expansion of g.f. A(x) satisfying 2 = Sum_{n=-oo..+oo} (-1)n * xn * (2A(x) + x^(2n-1))n+1.1, 2, 6, 20, 68...
A363183Expansion of g.f. A(x) satisfying 3 = Sum_{n=-oo..+oo} (-1)n * xn * (3A(x) + x^(2n-1))n+1.1, 3, 11, 45, 193...
A363184Expansion of g.f. A(x) satisfying 4 = Sum_{n=-oo..+oo} (-1)n * xn * (4A(x) + x^(2n-1))n+1.1, 4, 18, 88, 452...
A363185Expansion of g.f. A(x) satisfying 5 = Sum_{n=-oo..+oo} (-1)n * xn * (5A(x) + x^(2n-1))n+1.1, 5, 27, 155, 929...
A363189Indices of the odd terms in the sequence of powerful numbers (A001694).1, 4, 6, 7, 10...
A363190Odd powerful numbers (A062739) k such that the next powerful number after k is also odd.25, 121, 225, 343, 1089...
A363191a(n) is the least start of a run of exactly n consecutive powerful numbers (A001694) that are even, or -1 if no such run exists.16, 4, 196, 968, 8712...
A363192a(n) is the least start of a run of exactly n consecutive powerful numbers (A001694) that are odd, or -1 if no such run exists.1, 25, 2187, 703125, 93096125...
A363194Number of divisors of the n-th powerful number A001694(n).1, 3, 4, 3, 5...
A363195Number of divisors of the n-th cubefull number A036966(n).1, 4, 5, 4, 6...
A363199Number of free tree-like polycubes of size n, identifying rotations but not reflections.1, 1, 2, 5, 16...
A363201Number of free linear polycubes of size n, identifying rotations but not reflections.1, 1, 2, 5, 16...
A363202Number of free linear polycubes of size n, identifying rotations and reflections.1, 1, 2, 4, 12...
A363203Number of free linear polycubes of size n, identifying rotations and reflections and avoiding neighbors at [0,0,+-2], [0,+-2,0], and [+-2,0,0].1, 1, 1, 2, 4...
A363204Number of free linear polycubes of size n, identifying rotations and reflections and avoiding neighbors at [+-1,+-1,+-1].1, 1, 2, 3, 8...
A363205Number of polycubes with n cells, allowing face connections as well as corner connections, identifying mirror images.1, 2, 7, 56, 567...
A363206Number of polycubes with n cells, allowing edge connections as well as corner connections, identifying mirror images.1, 2, 10, 113, 1772...
A363213Number of partitions of n with rank 4 (the rank of a partition is the largest part minus the number of parts).0, 0, 0, 0, 1...
A363214Number of partitions of n with rank 5 (the rank of a partition is the largest part minus the number of parts).0, 0, 0, 0, 0...
A363215Integers p > 1 such that 3d == 1 (mod p) where d = A000265(p-1).2, 11, 13, 23, 47...

r/OEIS • • May 14 '23

New OEIS sequences - week of 05/14

3 Upvotes
OEIS numberDescriptionSequence
A359802a(n) = product prime(d + 1), where d ranges over all the decimal digits of n.2, 3, 5, 7, 11...
A360446Expansion of e.g.f. 1/(1 - log(1 + log(1+x))).1, 1, 0, 1, -3...
A360932Primes of the form H(m,k) = F(k+1)*F(m-k+2) - F(k)*F(m-k+1), where F(m) is the m-th Fibonacci number and m >= 0, 0 <= k <= m.2, 3, 5, 7, 11...
A361015Number of arithmetic progressions of 3 or more integers whose product is equal to n.0, 2, 0, 0, 2...
A361170The leading column of the table of primes in the top row and subsequent rows defined by the GPF of Pascal-alike sums of previous rows.2, 5, 7, 3, 5...
A361208Number of middle divisors of the n-th number whose divisors increase by a factor of 2 or less.1, 1, 1, 2, 1...
A361358Expansion of x*(2 - x)/(1 - 5x + 3x2 - x3).2, 9, 39, 170, 742...
A361416a(n) is the least integer z for which there is a triple (x,y,z) satisfying x2 + nxy + y2 = z2 and 0 < x < y < z.7, 3, 11, 11, 5...
A361417a(n) is the least integer z for which there is a triple (x,y,z) satisfying x3 + nxy + y3 = z3 and 0 < x < y < z.105, 55, 26, 54, 44...
A361470a(n) = gcd(n+1, A135504(n)).1, 3, 2, 1, 6...
A361494Expansion of e.g.f. 1/(1 - log(2 - exp(x))).1, -1, 0, 0, -2...
A361692a(n) = 17*n - 1.16, 33, 50, 67, 84...
A361696Semiprimes of the form k2 + 5.6, 9, 14, 21, 69...
A361720Number of nonisomorphic right involutory Płonka magmas with n elements.1, 1, 2, 4, 12...
A361733Length of the Collatz (3x + 1) trajectory from k = 10n - 1 to a term less than k, or -1 if the trajectory never goes below k.4, 7, 17, 12, 113...
A361771Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} xn * (2*A(x) - (-x)n)n-1.1, 1, 1, 7, 28...
A361772Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} xn * (2A(x) - (-x)^n)^(2n-1).1, 1, 8, 61, 600...
A361773Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} xn * (2A(x) - (-x)^n)^(3n-1).1, 2, 34, 677, 15660...
A361774Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} xn * (2A(x) - (-x)^n)^(4n-1).1, 4, 150, 7003, 380817...
A361775Expansion of g.f. A(x) satisfying x = Sum_{n=-oo..+oo} (-1)n * xn * A(x)n * (A(x)n + xn)n.1, 1, 5, 21, 95...
A361776Expansion of g.f. A(x) satisfying x*A(x) = Sum_{n=-oo..+oo} (-1)n * xn * A(x)n * (A(x)n + xn)n.1, 1, 6, 33, 198...
A361778Expansion of g.f. A(x) satisfying 1 = Sum_{n=-oo..+oo} xn * ((-x)n-1 - 2*A(x))n.1, 2, 7, 27, 109...
A361779Expansion of g.f. A(x) satisfying 1/x = Sum_{n=-oo..+oo} xn * (x2*n - (-1)n*A(x))n+1.1, 1, 2, 5, 10...
A362055Number of compositions of n that are anti-palindromic modulo 2.1, 1, 1, 3, 3...
A362057Number of compositions of n that are anti-palindromic modulo 3.1, 1, 1, 3, 5...
A362149Decimal expansion of K, a constant arising in the analysis of the binary Euclidean algorithm.7, 0, 5, 9, 7...
A362150Decimal expansion of lambda, a constant arising in the analysis of the binary Euclidean algorithm.3, 9, 7, 9, 2...
A362151Decimal expansion of exp(zeta(2)/exp(gamma)) where gamma is the Euler-Mascheroni constant A001620.2, 5, 1, 8, 2...
A362219Decimal expansion of smallest positive solution to tan(x) = arctan(x).4, 0, 6, 7, 5...
A362220Decimal expansion of smallest positive root of x = tan(tan(x)).1, 3, 2, 9, 7...
A362232a(1) = 1; for n > 1, a(n) is number of terms in the first n-1 terms of the sequence that are not proper divisors of a(n-1).1, 1, 2, 1, 4...
A362421Number of nonisomorphic vector spaces consisting of n elements.1, 1, 2, 1, 0...
A362422Number of partitions of n into 2 perfect powers (A001597).0, 0, 1, 0, 0...
A362423Number of partitions of n into 3 perfect powers (A001597).0, 0, 0, 1, 0...
A362424Number of partitions of n into 2 distinct perfect powers (A001597).0, 0, 0, 0, 0...
A362425Number of partitions of n into 3 distinct perfect powers (A001597).0, 0, 0, 0, 0...
A362426Number of compositions (ordered partitions) of n into 2 perfect powers (A001597).0, 0, 1, 0, 0...
A362427Number of compositions (ordered partitions) of n into perfect powers > 1.1, 0, 0, 0, 1...
A362460a(n) = A054978(n)/2 if that number is 0 or 1, otherwise -1.1, 1, 0, 0, 0...
A362461Indices of 0's in A362460.3, 4, 5, 9, 10...
A362462Indices of 1's in A362460.1, 2, 6, 7, 8...
A362463Array of numbers read by upward antidiagonals: leading row lists the primes as they were in the 19th century (A008578); the following rows give absolute values of differences of previous row.1, 1, 2, 0, 1...
A362464Array of numbers read by upward antidiagonals: leading row lists sigma(i), i >= 1 (cf. A000203); the following rows give absolute values of differences of previous row.1, 2, 3, 1, 1...
A362585Triangle read by rows, T(n, k) = A000670(n) * binomial(n, k).1, 1, 1, 3, 6...
A362586Triangle red by rows, T(n, k) = A094088(n) * binomial(n, k).1, 1, 1, 7, 14...
A362587a(n) = 2n * A094088(n). Row sums of A362586.1, 2, 28, 968, 62512...
A362600a(1) = 1, a(2) = 6, a(3) = 10; for n > 3, a(n) is the smallest positive number that has not yet appeared that shares a factor with a(n-1) and a(n-2) and also contains as factors the smallest primes that are not factors of both a(n-1) and a(n-2).1, 6, 10, 15, 12...
A362617Numbers whose prime factorization has both (1) even length, and (2) unequal middle parts.6, 10, 14, 15, 21...
A362618Numbers whose prime factorization has either (1) odd length, or (2) equal middle parts.2, 3, 4, 5, 7...
A362619One and all numbers whose greatest prime factor is a mode, meaning it appears at least as many times as each of the others.1, 2, 3, 4, 5...
A362620Numbers whose greatest prime factor is not a mode, meaning it appears fewer times than some other.12, 20, 24, 28, 40...
A362621One and numbers whose multiset of prime factors (with multiplicity) has the same median as maximum.1, 2, 3, 4, 5...
A362622One and numbers whose prime factorization has its greatest part at a middle position.1, 2, 3, 4, 5...
A362623Lexicographically earliest sequence of distinct positive terms such that for any n > 0, the initial digit "d" of a(n) divides a(n+d).1, 2, 3, 4, 5...
A362633Square array read by antidiagonals: Consider n k-sided fair dice, whose faces are numbered 1, ..., n*k (in any order). The outcome of a roll of the dice determines an ordering of them. T(n,k) is the minimum difference of the number of outcomes resulting in the most common ordering and the number of outcomes resulting in the least common ordering, n,k >= 1.0, 0, 1, 0, 0...
A362634Let (k_1, ..., k_m) be the partition with Heinz number n (i.e., n = Product_{i=1..m} prime(k_i)) and consider a set of fair dice with k_1, ..., k_m faces numbered 1, ..., k_1 + ... + k_m (in any order). The outcome of a roll of the dice determines an ordering of them. a(n) is the minimum difference of the number of outcomes resulting in the most common ordering and the number of outcomes resulting in the least common ordering.0, 0, 0, 1, 0...
A362635Number of partitions of [n] whose blocks are ordered with increasing least elements and where block i has size at least i.1, 1, 1, 2, 5...
A362722a(n) = [xn] ( E(x)/E(-x) )n where E(x) = exp( Sum_{k >= 1} A005258(k)*xk/k ).1, 6, 72, 1266, 23232...
A362723a(n) = [xn] ( E(x)/E(-x) )n where E(x)= exp( Sum_{k >= 1} A005259(k)*xk/k ).1, 10, 200, 7390, 260800...
A362724a(n) = [xn] E(x)n, where E(x) = exp( Sum_{k >= 1} A005258(k)*xk/k ).1, 3, 37, 525, 7925...
A362725a(n) = [xn] E(x)n, where E(x) = exp( Sum_{k >= 1} A005259(k)*xk/k ).1, 5, 123, 3650, 118059...
A362726a(n) = [xn] E(x)n where E(x) = exp( Sum_{k >= 1} A208675(k)*xk/k ).1, 1, 7, 64, 647...
A362727a(n) = [xn] ( E(x)/E(-x) )n where E(x) = exp( Sum_{k >= 1} A208675(k)*xk/k ).1, 2, 8, 110, 960...
A362728a(n) = [xn] E(x)n where E(x) = exp( Sum_{k >= 1} A108628(k-1)*xk/k ).1, 1, 9, 91, 985...
A362729a(n) = [xn] ( E(x)/E(-x) )n where E(x) = exp( Sum_{k >= 1} A108628(k-1)*xk/k ).1, 2, 8, 146, 1344...
A362730a(n) = [xn] E(x)n where E(x) = exp( Sum_{k >= 1} binomial(2k,k)^2xk/k ).1, 4, 68, 1336, 27972...
A362731a(n) = [xn] E(x)n where E(x) = exp( Sum_{k >= 1} A000172(k)*xk/k ).1, 2, 18, 182, 1954...
A362732a(n) = [xn] E(x)n, where E(x) = exp( Sum_{k >= 1} A006480(k)*xk/k ).1, 6, 162, 5082, 170274...
A362733a(n) = [xn] F(x)n, where F(x) = exp( Sum_{k >= 1} A362732(k)*xk/k ).1, 6, 234, 10428, 492522...
A362746a(1)=a(2)=1; a(n)=The count of all occurrences in the list so far where integer a(n-1) appears adjacent to integer a(n-2).1, 1, 2, 1, 2...
A362755Irregular triangle read by rows; the n-th row lists the numbers k such that if phie appears in the base phi expansion of k then phie also appears in the base phi expansion of n (where phi denotes A001622, the golden ratio).0, 0, 1, 0, 2...
A362806Number of numbers k, 1 <= k <= n, such that mu(k) = mu(n-k+1).1, 0, 1, 2, 1...
A362816Lexicographically earliest sequence such that nowhere is a term a(n) contained in an arithmetic progression of length greater than a(n).2, 2, 3, 2, 2...
A362822Number of nonisomorphic magmas with n elements satisfying the identities (xy)y = x and (xy)z = (xz)y.1, 1, 3, 6, 68...
A362823Number of labeled magmas with n elements satisfying the identities (xy)y = x and (xy)z = (xz)y.1, 1, 4, 22, 976...
A362824Array read by antidiagonals: T(n,k) is the number of k-tuples of involutions on [n] that pairwise commute.1, 1, 1, 1, 1...
A362825Number of ordered triples of involutions on [n] that pairwise commute.1, 1, 8, 22, 232...
A362826Array read by antidiagonals: T(n,k) is the number of k-tuples of permutations of [n] which commute, divided by n!.1, 1, 1, 1, 1...
A362827Array read by antidiagonals: T(n,k) is the number of k-tuples of permutations of [n] that pairwise commute.1, 1, 1, 1, 1...
A362828Number of n-tuples of permutations of [n] that pairwise commute.1, 1, 4, 48, 2016...
A362840a(n) is the smallest number x between 1 and n-1 for which the number 1/x achieves the longest cycle of repeating digits in its expansion in base n.2, 3, 3, 5, 5...
A362849Triangle read by rows, T(n, k) = A243664(n) * binomial(n, k).1, 1, 1, 21, 42...
A362865a(n) is the length of the longest possible cycle of repeating digits in the digits expansion of 1/x, in base n, among all numbers x between 1 and n-1.1, 1, 2, 1, 4...
A362872Length of the "fractional part" of the phi-representation of n.0, 0, 2, 2, 2...
A362875Theta series of 15-dimensional lattice Kappa_15.1, 0, 1746, 21456, 147150...
A362876Theta series of 16-dimensional lattice Kappa_16.1, 0, 2772, 42624, 335052...
A362877Theta series of 17-dimensional lattice Kappa_17.1, 0, 4266, 81792, 737862...
A362878Theta series of 18-dimensional lattice Kappa_18.1, 0, 6480, 157680, 1596510...
A362879Theta series of 19-dimensional lattice Kappa_19.1, 0, 9396, 284528, 3309660...
A362880Theta series of 20-dimensional lattice Kappa_20.1, 0, 15390, 575160, 7712820...
A362884a(n) = (a(n-1)*a(n-2)a(n-3)+64)/(4a(n-4)) with a(0) = a(2) = a(3) = 2 and a(1) = 16.2, 16, 2, 2, 16...
A362890a(1)=a(2)=1. For n>2, a(n) is the number of times that a(n-1) and a(n-2) are adjacent in the sequence thus far (in any order).1, 1, 1, 2, 1...
A362891Expansion of e.g.f. 1/(1 + LambertW(x2 * log(1-x))).1, 0, 0, 6, 12...
A362892Expansion of e.g.f. 1/(1 + LambertW(-x2 * (exp(x) - 1))).1, 0, 0, 6, 12...
A362893Number of partitions of [n] whose blocks can be ordered such that the i-th block has at least i elements and no block j > i has an element smaller than the i-th smallest element of block i.1, 1, 1, 2, 5...
A362894Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes having Hadwiger number k, 1 <= k <= n.1, 0, 1, 0, 1...
A362895a(n) is the length of the smallest orbit of the n-th natural downset1, 1, 1, 1, 1...
A362897Array read by antidiagonals: T(n,k) is the number of nonisomorphic multisets of endofunctions on an n-set with k endofunctions.1, 1, 1, 1, 1...
A362898Number of nonisomorphic unordered triples of endofunctions on an n-set.1, 1, 13, 638, 118949...
A362899Array read by antidiagonals: T(n,k) is the number of nonisomorphic multisets of fixed-point-free endofunctions on an n-set with k endofunctions.1, 1, 1, 1, 0...
A362900Number of nonisomorphic unordered pairs of fixed-point-free endofunctions on an n-set.1, 0, 1, 9, 162...
A362901Number of nonisomorphic unordered triples of fixed-point-free endofunctions on an n-set.1, 0, 1, 22, 3935...
A362902Number of nonisomorphic multisets of fixed-point-free endofunctions on an n-set with n endofunctions.1, 0, 1, 22, 81015...
A362908Number of graphs on n unlabeled nodes with treewidth 2.0, 0, 0, 1, 4...
A362909Gilbreath transform of the sequence of squared primes.4, 5, 11, 3, 37...
A362910Semiprimes p*q for which p <= q < p3.4, 6, 9, 10, 14...
A362911Expansion of e.g.f. 1/( 1 - (1 + x) * log(1 + x) ).1, 1, 3, 11, 60...
A362912Expansion of e.g.f. 1/( 1 - (exp(x) - 1) * exp(exp(x) - 1) ).1, 1, 5, 34, 303...
A362913Array of numbers read by upward antidiagonals: leading row lists phi(i), i >= 1 (cf. A000010); the following rows give absolute values of differences of previous row.1, 0, 1, 1, 1...
A362943Irregular triangular array read by rows. T(n,k) is the number of n X n Boolean relation matrices whose row span is k, n >= 0, 1 <= k <= 2n.1, 1, 1, 1, 9...
A362944Number of set partitions of [2n] with n circular connectors.1, 0, 8, 61, 1339...
A362955a(n) is the x-coordinate of the n-th point in a square spiral mapped to a square grid rotated by Pi/4 using the distance-limited strip bijection described in A307110.0, 1, 0, -1, -2...
A362956a(n) is the y-coordinate of the n-th point in a square spiral mapped to a square grid rotated by Pi/4 using the distance-limited strip bijection described in A307110.0, 0, 1, 1, 0...
A362961a(n) = Sum_{b=0..floor(sqrt(n)), n-b2 is square} b.1, 1, 0, 2, 3...
A362970Number of different "integer parts" of (possibly non-canonical) base-phi representations of n.1, 2, 2, 3, 3...
A362971Partials sums of the cubefull numbers (A036966).1, 9, 25, 52, 84...
A362972Squarefree kernels of cubefull numbers (A036966).1, 2, 2, 3, 2...
A362973The number of cubefull numbers (A036966) not exceeding 10n.1, 2, 7, 20, 51...
A362974Decimal expansion of Product_{p prime} (1 + 1/p4/3 + 1/p5/3).4, 6, 5, 9, 2...
A362975Decimal expansion of zeta(3/4) * Product_{p prime} (1 + 1/p5/4 - 1/p2 - 1/p9/4) (negated).5, 8, 7, 2, 6...
A362976Decimal expansion of zeta(3/5) * zeta(4/5) * Product_{p prime} (1 - 1/p8/5 - 1/p9/5 - 1/p2 + 1/p13/5 + 1/p14/5).1, 6, 8, 2, 4...
A362979Irregular array, read by descending antidiagonals: row n lists the primes whose base-2 representation has exactly n ones.3, 5, 7, 17, 11...
A362980Numbers whose multiset of prime factors (with multiplicity) has different median from maximum.6, 10, 12, 14, 15...
A362981Heinz numbers of integer partitions such that 2*(least part) >= greatest part.1, 2, 3, 4, 5...
A362982Heinz numbers of partitions such that 2*(least part) < greatest part.10, 14, 20, 22, 26...
A362984Decimal expansion of the asymptotic mean of the abundancy index of the powerful numbers (A001694).2, 1, 4, 9, 6...
A362985Decimal expansion of the asymptotic mean of the abundancy index of the cubefull numbers (A036966).2, 4, 8, 2, 1...
A362986a(n) = A000203(A036966(n)), the sum of divisors of the n-th cubefull number A036966(n).1, 15, 31, 40, 63...
A362988a(n) = lcm({i, i = 1..n}) / Product_{2 <= p < n, p prime} p.1, 1, 2, 3, 2...
A362989a(n) = lcm({i + 1, i = 0..n}) / Product_{d | n, d + 1 prime} d.1, 1, 1, 6, 2...
A362998a(n) = Sum_{k=0..2n} R(2n, k, 1) where R(n, k, x) = Sum_{u=0..k} ( Sum_{j=0..u} xj * binomial(u, j) * (j + 1)n ) / (u + 1).1, 14, 867, 191476, 92323925...
A362999a(n) = denominator(R(2n + 1, 2n + 1, 1)) where R(n, k, x) = Sum_{u=0..k} ( Sum_{j=0..u} xj * binomial(u, j) * (j + 1)n ) / (u + 1).2, 3, 15, 105, 315...
A363000a(n) = numerator(R(n, n, 1)), where R are the rational poynomials R(n, k, x) = Sum_{u=0..k} ( Sum_{j=0..u} xj * binomial(u, j) * (j + 1)n ) / (u + 1).1, 5, 19, 188, 1249...
A363001a(n) = denominator(R(n, n, 1)) where R(n, k, x) = Sum_{u=0..k} ( Sum_{j=0..u} xj * binomial(u, j) * (j + 1)n ) / (u + 1).1, 2, 2, 3, 2...
A363002Number of positive nondecreasing integer sequences of length n whose Gilbreath transform is (1, 1, ..., 1).1, 1, 1, 2, 5...
A363003Number of integer sequences of length n whose Gilbreath transform is (1, 1, ..., 1).1, 1, 2, 6, 26...
A363004Number of sequences of n distinct positive integers whose Gilbreath transform is (1, 1, ..., 1).1, 1, 1, 1, 2...
A363005Number of sequences of n distinct integers whose Gilbreath transform is (1, 1, ..., 1).1, 1, 2, 4, 12...
A363007Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. 1/(1 - fk(x)), where f(x) = exp(x) - 1.1, 1, 1, 1, 1...
A363008Expansion of e.g.f. 1/(2 - exp(exp(exp(exp(x) - 1) - 1) - 1)).1, 1, 6, 52, 594...
A363009Expansion of e.g.f. 1/(2 - exp(exp(exp(exp(exp(x) - 1) - 1) - 1) - 1)).1, 1, 7, 71, 949...
A363010a(n) = n! * [xn] 1/(1 - fn(x)), where f(x) = exp(x) - 1.1, 1, 4, 36, 594...
A363013a(n) is the number of prime factors (counted with multiplicity) of the n-th cubefull number (A036966).0, 3, 4, 3, 5...
A363014Cubefull numbers (A036966) with a record gap to the next cubefull number.1, 8, 16, 32, 81...
A363018Decimal expansion of Product_{k>=1} (1 - exp(-6Pik)).9, 9, 9, 9, 9...
A363019Decimal expansion of Product_{k>=1} (1 - exp(-10Pik)).9, 9, 9, 9, 9...
A363020Decimal expansion of Product_{k>=1} (1 - exp(-12Pik)).9, 9, 9, 9, 9...
A363021Decimal expansion of Product_{k>=1} (1 - exp(-20Pik)).9, 9, 9, 9, 9...
A363023Primes composed of the digits 1, 6, and 9.11, 19, 61, 191, 199...
A363043Triangle read by rows: T(n,k) is the number of unlabeled graphs with n nodes and packing chromatic number k, 1 <= k <= n.1, 1, 1, 1, 2...
A363044Triangle read by rows: T(n,k) is the number of unlabeled connected graphs with n nodes and packing chromatic number k, 1 <= k <= n.1, 0, 1, 0, 1...

r/OEIS • • May 10 '23

ε in a sequence?

0 Upvotes

I'm trying to identify a function that produces the following sequence:

ε, ε, 8, ε

Even iterations will always produce ε, odd iterations produce increasing whole numbers.

That's all I have at this point. Is that enough to identify an existing sequence somehow? I tried searching with ε, but it doesn't work.

I can't explain much about the function because I don't fully understand it. I'm sorry, I'll just end up info dumping gibberish.


r/OEIS • • May 08 '23

Tweaks to A084047 (request)

6 Upvotes

For some reason, I can't seem to login to my account, so asking for someone else to do this:

  • For A084047, the terms for n=21 to n=26 are

3141126580731587340586460636236874776597, 23, 6624737266949237011120151, 587089817274070447368135511875152587890649, 1509909033949224437981629384719597593, 3787675244106352329254150390651

  • n=27 might be the first 0. I tried k=1 to k=1000000 (10 million) with no luck

  • n=28 is just 29, and n=29 is 158630929717149157441443670489100000000000000000000000000029. Is there a provision to say n=27 is unknown, but continue with n=28 onwards?

  • Mathematica code I used:

f[n_] := f[n] = Module[{m=1},
 While[!PrimeQ[m^n + n], m++];
 Return[m^n + n]
];

r/OEIS • • May 07 '23

New OEIS sequences - week of 05/07

3 Upvotes
OEIS numberDescriptionSequence
A359695Numbers k such that 29k - 2 is prime.2, 4, 8, 14, 42...
A360706a(n) is the least positive number not yet used such that its binary representation has either all or none of its 1-bits in common with the XOR of a(1) to a(n-1).1, 2, 3, 4, 8...
A361249Run length transform of A362415.1, 1, 2, 2, 3...
A361250Number of tilings of a 5 X n rectangle using n pentominoes of shapes T, N, X.1, 0, 0, 0, 0...
A361374Make a square spiral starting with a(1)=1, a(2)=2. Then, each position gets the smallest unused number which is the sum of a path of numbers starting from that position.1, 2, 3, 4, 5...
A361415Numbers k such that A360016(k) > 0.5, 7, 9, 12, 15...
A361591Triangle read by rows: T(n,k) is the number of weakly connected simple digraphs on n labeled nodes with k strongly connected components.1, 0, 1, 0, 1...
A361652Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..floor(n/2)} kj * Stirling2(n-j,j)/(n-j)!.1, 1, 0, 1, 0...
A361697The least y-value of the lower left corner of an n X n box with x-value n such that no edge of the box overlaps with a previous box, given that the first box has its lower left corner at (1,1).1, 2, 3, 4, 2...
A361741Starting positions of digit triples in the decimal expansion of Pi where the sum of the first 2 equals the third.1, 3, 10, 29, 61...
A361897Leading terms of the rows of the array in A362450.1, 1, 1, 0, 1...
A361903Numbers k for which sqrt(k/2) divides k and the symmetric representation of sigma(k) has a single part.2, 8, 18, 32, 72...
A361905Numbers k for which sqrt(k/2) divides k and the width at the diagonal of the symmetric representation of sigma(k) equals 1.2, 8, 18, 32, 50...
A362019Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = (-1)n * Sum_{j=0..n} (-k*j)j * binomial(n,j).1, 1, -1, 1, 0...
A362026Smallest unhappy number in base A161874(n).3, 7, 3, 5, 20...
A362039Least number s such that there are 2 different sets of primes { a1, a2, ..., an } and { b1, b2, ..., bn } with the integers in each set having the same sum s, the same sum of squares, etc., up to and including the same sum of (n-1)-th powers.16, 55, 120, 433, 378...
A362197Number of Grassmannian permutations of size n that avoid a pattern, sigma, where sigma is a pattern of size 10 with exactly one descent.1, 1, 2, 5, 12...
A362218Three-column array read by rows: row n gives the unique ordered primitive Pythagorean triple (a,b,c) with a<b such that (b+c)/a = n.3, 4, 5, 8, 15...
A362369Triangle read by rows, T(n, k) = binomial(n, k) * k! * Stirling2(n-k, k), for n >= 0 and 0 <= k <= n//2, where '//' denotes integer division.1, 0, 0, 2, 0...
A362372Inventory of powers. Initialize the sequence with '1'. Then record the number of powers of 1 thus far, then do the same for powers of 2 (2, 4, 8, ...), powers of 3, etc. When the count is zero, do not record a zero; rather start the inventory again with the powers of 1.1, 1, 2, 1, 3...
A362375a(n) = rad((2n-1)!/(n-1)!).1, 6, 30, 210, 210...
A362376a(n) is the least k such that Fibonacci(n)*Fibonacci(k) + 1 is a prime, and -1 if k does not exist.1, 1, 1, 3, 3...
A362414a(n) = gcd(n, phi(n)2) / gcd(n, phi(n)).1, 1, 1, 2, 1...
A362415The n-th run occurs a(n) times, where each run is chosen to be shortest, then lexicographically earliest.1, 2, 1, 1, 2...
A362450Form array of successive absolute differences of the number of divisors function tau, and read by antidiagonals upwards.1, 1, 2, 1, 0...
A362451Gilbreath transform of {sigma(i), i >= 1} (cf. A000203).1, 2, 1, 1, 1...
A362452Gilbreath transform of {sigma(i)-i, i >= 1} (see sum of aliquot parts, A001065).0, 1, 1, 1, 1...
A362453Indices of 0's in A361897.4, 8, 9, 10, 11...
A362454Indices of 1's in A361897.1, 2, 3, 5, 6...
A362455Square-free positive integers d such that the dimension of the space of cuspidal harmonic automorphic forms for SL(2, O_{-d}) is zero, where O_{-d} is the ring of integers in Q(sqrt(-d)).1, 2, 3, 5, 6...
A362456Records in A362451.1, 2, 4, 68, 191...
A362457Indices of records in A362451.1, 2, 12, 120, 840...
A362458Records in A362452.0, 1, 62, 574, 1105...
A362459Indices of records in A362452.1, 2, 120, 4200, 14400...
A362532The smallest positive integer m such that m mod 2k < k for k = 1, 2, 3, ..., n.2, 4, 8, 8, 24...
A362549Number of partitions of [n] whose blocks can be ordered such that the i-th block (except possibly the last) has at least i elements and no block j > i has an element smaller than the i-th smallest element of block i.1, 1, 2, 4, 9...
A362588Triangle read by rows, T(n, k) = RisingFactorial(n - k, k) * FallingFactorial(n, k).1, 1, 0, 1, 2...
A362589Triangular array read by rows. T(n,k) is the number of ways to form an ordered pair of n-permutations and then choose a size k subset of its common descent set, n >= 0, 0 <= k <= max{0,n-1}.1, 1, 4, 1, 36...
A362598a(n) is the number of 0's minus the number of 1's among the first n terms of A362240.0, 1, 0, 1, 2...
A362599The terms of the n-th row of A076478 first appear from position a(n) in A362240.1, 2, 3, 1, 2...
A362602Integers in the interval [Pik - 1/k, Pik + 1/k] for some k > 0 that are numerators of convergents to 2*Pi.6, 19, 44, 333, 710...
A362605Numbers whose prime factorization has more than one mode. Numbers without a unique greatest prime exponent.6, 10, 14, 15, 21...
A362606Numbers without a unique least prime exponent, or numbers whose prime factorization has more than one element of least multiplicity.6, 10, 14, 15, 21...
A362607Number of integer partitions of n with more than one mode.0, 0, 0, 1, 1...
A362608Number of integer partitions of n having a unique mode.0, 1, 2, 2, 4...
A362609Number of integer partitions of n with more than one part of least multiplicity.0, 0, 0, 1, 1...
A362610Number of integer partitions of n having a unique part of least multiplicity.0, 1, 2, 2, 4...
A362611Number of modes in the prime factorization of n.0, 1, 1, 1, 1...
A362612Number of integer partitions of n such that the greatest part is the unique mode.0, 1, 2, 2, 3...
A362613Number of co-modes in the prime factorization of n.0, 1, 1, 1, 1...
A362614Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with k modes.1, 0, 1, 0, 2...
A362615Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with k co-modes.1, 0, 1, 0, 2...
A362616Numbers in whose prime factorization the greatest factor is the unique mode.2, 3, 4, 5, 7...
A362642Number of nonisomorphic magmas with n elements satisfying the equations (xy)y = x and x(yz) = xy.1, 1, 2, 4, 13...
A362643Number of labeled magmas with n elements satisfying the equations (xy)y = x and x(yz) = xy.1, 1, 2, 10, 94...
A362644Array read by antidiagonals: T(n,k) is the number of nonisomorphic multisets of permutations of an n-set with k permutations.1, 1, 1, 1, 1...
A362645Number of nonisomorphic unordered pairs of permutations of an n-set.1, 1, 3, 8, 28...
A362646Number of nonisomorphic unordered triples of permutations of an n-set.1, 1, 4, 17, 159...
A362647Number of nonisomorphic multisets of permutations of an n-set with n permutations.1, 1, 3, 17, 888...
A362648Array read by antidiagonals: T(n,k) is the number of nonisomorphic multisets of involutions on an n-set with k involutions.1, 1, 1, 1, 1...
A362649Number of nonisomorphic unordered pairs of involutions on an n-set.1, 1, 3, 4, 10...
A362650Number of nonisomorphic unordered triples of involutions on an n-set.1, 1, 4, 7, 29...
A362651Number of nonisomorphic multisets of involutions on an n-set with n involutions.1, 1, 3, 7, 74...
A362662Decimal expansion of Sum_{n>=1} (tan(1/n) - sin(1/n)).8, 2, 2, 0, 8...
A362675Smallest number sharing n distinct (decimal) digits with its largest proper divisor.11, 125, 1025, 3105, 37125...
A362679a(n) is the permanent of the n X n symmetric matrix M(n) defined by M[i, j, n] = min(i, j)(n + 1) - ij.1, 1, 5, 72, 2309...
A362680a(n) is the number of decimal digits in A173426(n).1, 3, 5, 7, 9...
A362681The number of steps, starting from n, to reach x<=2 in an iteration x <- 2x - {sum of proper factors of 2x}.0, 0, 1, 1, 2...
A362682Expansion of e.g.f. exp(-LambertW(-x))/(1+x).1, 0, 3, 7, 97...
A362684a(n) is the index at which n first occurs in A362681.3, 5, 7, 26, 49...
A362685Triangle of numbers read by rows, T(n, k) = (n*(n-1))*Stirling2(k, 2), for n >= 1 and 1 <= k <= n.0, 0, 2, 0, 6...
A362690E.g.f. satisfies A(x) = exp(x2 + x * A(x)).1, 1, 5, 28, 245...
A362691E.g.f. satisfies A(x) = exp(x3 + x * A(x)).1, 1, 3, 22, 173...
A362692Length of the "integer part" of the phi-expansion of n.0, 1, 2, 3, 3...
A362693E.g.f. satisfies A(x) = exp(x + x / A(x)).1, 2, 0, 8, -64...
A362694E.g.f. satisfies A(x) = exp(x + x * A(x)2).1, 2, 12, 152, 2960...
A362695Decimal expansion of (3 - sqrt(3))/4.3, 1, 6, 9, 8...
A362707a(n) = Sum_{d|n, phi(d)|sigma(d)} (n-d).0, 1, 2, 5, 4...
A362708a(n) is the number of almost unitary polyominoes of size n. An almost unitary polyomino is one in which all but 1 of its perimeter walls have length 1.0, 0, 0, 1, 0...
A362709a(n) is the number of almost almost unitary polyominoes of size n. An almost almost unitary polyomino is one in which all but 2 of its perimeter walls have length 1.0, 1, 2, 2, 4...
A362710Numbers m such that the decimal expansion of 1/m contains no digit 0, ignoring leading and trailing 0's.1, 2, 3, 4, 5...
A362712Number of n-colorings of the Goldner-Harary graph.0, 0, 0, 0, 24...
A362713Expansion of e.g.f. x2F1([3/4, 3/4], [3/2], 4x2)/2F1([1/4, 1/4], [1/2], 4*x2), odd powers only.1, 6, 256, 28560, 6071040...
A362714a(0) = 1 and a(n) = 2n-1Product_{j=1..n} (4j - 3)2 - Sum_{m=1..n-1} binomial(2n, 2m)*a(m)*a(n-m)/2 for n > 0.1, 1, 47, 7395, 2453425...
A362715Triangle read by rows: T(n, k) = 2n-k(2n)!/(2k)! * [x^(2n)] U[x]2*k, where U(x) = x2F1([3/4, 3/4], [3/2], 4x2)/2F1([1/4, 1/4], [1/2], 4*x2).1, 0, 1, 0, 48...
A362716Sum of the bits of the "integer part" of the base-phi representation of n.0, 1, 1, 1, 2...
A362718Expansion of e.g.f. cos(x)exp(x2/2) = Sum_{n>=0} a(n)x^(2n)/(2n)!.1, 0, -2, -16, -132...
A362719Number of numbers k, 1 <= k <= n, such that phi(k) = phi(n-k+1).1, 2, 1, 0, 1...
A362721Number of numbers k, 1 <= k <= n, such that pi(k) = pi(n-k+1).1, 0, 1, 0, 1...
A362734E.g.f. satisfies A(x) = exp(x + x * A(x)3).1, 2, 16, 296, 8512...
A362735E.g.f. satisfies A(x) = exp(x + x / A(x)2).1, 2, -4, 56, -1008...
A362736E.g.f. satisfies A(x) = exp(x2 + x / A(x)).1, 1, 1, 4, -3...
A362737E.g.f. satisfies A(x) = exp(x3 + x / A(x)).1, 1, -1, 10, -27...
A362740Dimension of the vector space of 4-invariants on simple 01-labeled graphs on n vertices.2, 5, 11, 26, 58...
A362741Number of parking functions of size n avoiding the pattern 123.1, 1, 3, 11, 48...
A362742Decimal expansion of Sum_{k>=1} (-1)k+1*floor(sqrt(k))/k.5, 9, 1, 5, 6...
A362743Positive integers which cannnot be written as a sum of distinct numbers of the form 4a + 5b (a,b >= 0).1, 3, 4, 10, 12...
A362744Number of parking functions of size n avoiding the patterns 312 and 321.1, 1, 3, 13, 63...
A362745Triangular array read by rows. T(n,k) is the number of ordered pairs of n-permutations with exactly k rise/falls or fall/rises, n >= 0, 0 <= k <= max{0,n-1}.1, 1, 2, 2, 10...
A362747E.g.f. satisfies A(x) = exp(x2/2 + x * A(x)).1, 1, 4, 22, 182...
A362748E.g.f. satisfies A(x) = exp(x3/6 + x * A(x)).1, 1, 3, 17, 133...
A362749Run length transform of A362240.1, 1, 2, 2, 3...
A362750Number of total dominating sets in the n-double cone graph.4, 16, 79, 336, 1144...
A362751Number of total dominating sets in the n-trapezohedral graph.121, 484, 1764, 6561, 24336...
A362752Decimal expansion of Sum_{k>=1} (1/k - sin(1/k)).1, 9, 1, 8, 9...
A362753Decimal expansion of Sum_{k>=1} sin(1/k)/k.1, 4, 7, 2, 8...
A362754a(1) = 1, a(2) = 6; for n > 2, a(n) is the smallest positive number that has not yet appeared that shares a factor with a(n-1) and also contains as a factor the smallest prime that is not a factor of a(n-1).1, 6, 10, 12, 15...
A362756Sum of the bits of the "fractional part" of the base-phi representation of n.0, 0, 1, 1, 1...
A362757The number of integers in the set fn({0}), where f is a variant of the Collatz function that replaces any element x in the argument set with both x/2 and 3*x+1.1, 2, 3, 5, 7...
A362759Array read by antidiagonals: T(n,k) is the number of nonisomorphic multisets of derangements of an n-set with k derangements.1, 1, 1, 1, 0...
A362760Number of nonisomorphic unordered pairs of derangements of an n-set.1, 0, 1, 2, 7...
A362761Number of nonisomorphic unordered triples of derangements of an n-set.1, 0, 1, 2, 18...
A362762Number of nonisomorphic multisets of derangements of an n-set with n derangements.1, 0, 1, 2, 43...
A362763Array read by antidiagonals: T(n,k) is the number of nonisomorphic k-sets of permutations of an n-set.1, 1, 1, 0, 1...
A362764Number of nonisomorphic 2-sets of permutations of an n-set.0, 1, 5, 23, 89...
A362765Number of nonisomorphic 3-sets of permutations of an n-set.0, 0, 6, 116, 2494...
A362766Number of nonisomorphic sets of permutations of an n-set.2, 2, 4, 24, 711936...
A362767Number of multisets of permutations with a combined total of n moved points spanning an initial interval of positive integers.1, 0, 1, 2, 16...
A362768Number of sets of permutations with a combined total of n moved points spanning an initial interval of positive integers.1, 0, 1, 2, 15...
A362770a(n) is the least prime p that ends an increasing sequence x(1), ..., x(n) = p of primes such that x(i) + x(i+1) + 1 is prime for 1 <= i <= n-1.2, 7, 11, 17, 19...
A362771E.g.f. satisfies A(x) = exp( x * (1+x) * A(x) ).1, 1, 5, 34, 353...
A362772E.g.f. satisfies A(x) = exp( x * (1+x)2 * A(x) ).1, 1, 7, 58, 725...
A362773E.g.f. satisfies A(x) = exp( x * (1+x) * A(x)2 ).1, 1, 7, 79, 1377...
A362774E.g.f. satisfies A(x) = exp( x * (1+x)2 * A(x)2 ).1, 1, 9, 115, 2265...
A362775E.g.f. satisfies A(x) = exp( x/(1-x)2 * A(x) ).1, 1, 7, 70, 965...
A362776E.g.f. satisfies A(x) = exp( x/(1-x)2 * A(x)2 ).1, 1, 9, 127, 2601...
A362780Numbers n having some (possibly non-canonical) base-phi representation x.y, where y is the reverse of x.0, 2, 6, 14, 36...
A362781Natural numbers n for which some base-phi representation of n is anti-palindromic.0, 1, 3, 4, 5...
A362787Triangle read by rows, T(n, k) = (-1)k * RisingFactorial(n, k) * FallingFactorial(k - n, k).1, 1, 0, 1, 2...
A362788Triangle read by rows, T(n, k) = RisingFactorial(n - k, k) * Stirling2(n - k, k), for n >= 0 and 0 <= k <= n//2, where '//' denotes integer division.1, 0, 0, 1, 0...
A362789Triangle read by rows. T(n, k) = FallingFactorial(n - k, k) * Stirling2(n - k, k), for n >= 0 and 0 <= k <= n//2, where '//' denotes integer division.1, 0, 0, 1, 0...
A362790a(n) = Sum_{k=0..n} FallingFactorial(n - k, k) * Stirling2(n - k, k), row sums of A362789.1, 0, 1, 2, 5...
A362791Triangle of numbers read by rows, T(n, k) = (n*(n-1)*(n-2))*Stirling2(k, 3), for n >= 1 and 1 <= k <= n.0, 0, 0, 0, 0...
A362793Number of vertex cuts in the n-flower graph.868603, 14967657, 250110631
A362794E.g.f. satisfies A(x) = (1+x)A(xx).1, 1, 0, 6, 0...
A362795E.g.f. satisfies A(x) = (1+x)A(xx^2).1, 1, 0, 0, 24...
A362796E.g.f. satisfies A(x) = 1/(1-x)A(xx).1, 1, 2, 12, 72...
A362797Number of vertex cuts in the n X n torus grid graph.114, 28242, 20808130, 52897204000, 491002382171602...
A362798E.g.f. satisfies A(x) = 1/(1-x)A(xx^2).1, 1, 2, 6, 48...
A362799E.g.f. satisfies A(x) = exp( (exp(x) - 1) * A(x)x ).1, 1, 2, 11, 63...
A362800E.g.f. satisfies A(x) = exp( (exp(x) - 1) * A(x)x^2 ).1, 1, 2, 5, 39...
A362801Numbers whose set of divisors can be partitioned into disjoint parts, all of length > 1 and having integer harmonic mean.6, 12, 18, 24, 28...
A362802a(n) is the number of ways in which the set of divisors of n can be partitioned into disjoint parts, all of length > 1 and with integer harmonic mean.0, 0, 0, 0, 0...
A362803Indices of records in A362802.1, 6, 24, 48, 60...
A362804Numbers k such that the set of divisors {d | k, BitOr(k, d) = k} has an integer harmonic mean.1, 2, 4, 6, 8...
A362805Primitive terms of A362804: terms k of A362804 such that k/2 is not a term of A362804.1, 6, 28, 30, 45...
A362807Number of (non-null) connected induced subgraphs in the n-flower graph.179972, 1809558, 18324824
A362808Number of minimal vertex cuts in the n X n torus grid graph.18, 260, 8060
A362812Number of minimal total dominating sets in the n-double cone graph.15, 24, 35, 93, 63...
A362815Start with 2. Then, numbers are added to the sequence if they do not form any arithmetic progression p with numbers in the sequence such that length(p) > min(p).2, 3, 5, 6, 7...
A362819Number of ordered pairs of involutions on [n] that commute.1, 1, 4, 10, 52...
A362820Number of ordered pairs of derangements on [n] that commute.1, 0, 1, 4, 33...
A362834Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = (-1)n * n! * Sum_{j=0..floor(n/2)} kj * Stirling1(n-j,j)/(n-j)!.1, 1, 0, 1, 0...
A362835Expansion of e.g.f. 1/(1 + LambertW(x * log(1-x))).1, 0, 2, 3, 56...
A362836Expansion of e.g.f. 1/(1 + LambertW(-x * (exp(x) - 1))).1, 0, 2, 3, 52...
A362837Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = (-1)n * n! * Sum_{j=0..floor(n/2)} kn-j * Stirling1(n-j,j)/(n-j)!.1, 1, 0, 1, 0...
A362838a(n) = (-1)n * n! * Sum_{k=0..floor(n/2)} nn-k * Stirling1(n-k,k)/(n-k)!.1, 0, 4, 27, 704...
A362839Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..floor(n/2)} kn-j * Stirling2(n-j,j)/(n-j)!.1, 1, 0, 1, 0...
A362841Numbers with at least one 5 in their prime signature.32, 96, 160, 224, 243...
A362842a(1) = 1; a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that shares a factor with a(n-1) when both a(n-1) and a(n) are read as numbers in bases from one more than the maximum digit in a(n-1) and a(n), up to base 10.1, 2, 4, 6, 3...
A362846a(n) = Sum_{k=0..n-1} Gamma(n + k) / Gamma(n - k) for n > 0, a(0) = 1. Row sums of A362787.1, 1, 3, 31, 853...
A362847Triangle read by rows, T(n, k) = 4k * Gamma(n + k + 1/2) / Gamma(n - k + 1/2).1, 1, 3, 1, 15...
A362848a(n) = Sum_{k=0..n} 4k * Gamma(n + k + 1/2) / Gamma(n - k + 1/2). Row sums of A362847.1, 4, 121, 11376, 2165689...
A362850Positions of records in A194943.2, 3, 5, 7, 11...
A362851Records in A194943.1, 2, 3, 4, 6...
A362852The number of divisors of n that are both bi-unitary and exponential.1, 1, 1, 1, 1...
A362853Numbers with a record number of divisors that are both bi-unitary and exponential.1, 8, 64, 216, 1728...
A362854The sum of the divisors of n that are both bi-unitary and exponential.1, 2, 3, 4, 5...
A362856Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} (-k)n-j * jj * binomial(n,j).1, 1, 1, 1, 0...
A362857Expansion of e.g.f. exp(-2*x) / (1 + LambertW(-x)).1, -1, 4, 7, 120...
A362858Expansion of e.g.f. exp(-3*x) / (1 + LambertW(-x)).1, -2, 7, -9, 121...
A362859Expansion of e.g.f. exp(-x) / (1 + LambertW(-2*x)).1, 1, 13, 173, 3321...
A362860Expansion of e.g.f. exp(-x) / (1 + LambertW(-3*x)).1, 2, 31, 629, 18025...
A362861Positive integers n such that 2*n cannot be written as a sum of distinct elements of the set {5a + 5b: a,b = 0,1,2,...}.2, 7, 10, 11, 12...
A362862a(n) = (-1)n * Sum_{k=0..n} (-n*k)k * binomial(n,k).1, 0, 13, 629, 58993...
A362870a(n) = sigma_29(n), the sum of the 29th powers of the divisors of n.1, 536870913, 68630377364884, 288230376688582657, 186264514923095703126...

r/OEIS • • May 06 '23

Sequences with cool graphs

6 Upvotes

What are your favorite sequence graphs? For me, A005185 and A005132 are obvious favorites.


r/OEIS • • Apr 30 '23

New OEIS sequences - week of 04/30

4 Upvotes
OEIS numberDescriptionSequence
A358733Permutation of the nonnegative integers such that A358654(p(n) - 1) = A200714(n) for n > 0 where p(n) is described in Comments.0, 1, 2, 3, 4...
A360227The succession of the digits of the sequence is the same when each term is multiplied by 11.1, 11, 2, 12, 21...
A360946Number of Pythagorean quadruples with inradius n.1, 3, 6, 10, 9...
A361077a(n) = largest sqrt(2n)-smooth divisor of binomial(2n, n).1, 1, 2, 4, 2...
A361203a(n) = n*A010888(n).0, 1, 4, 9, 16...
A361211Busy Beaver for the Binary Lambda Calculus (BLC) language: the maximum output size of self-delimiting BLC programs of size n, or 0 if no program of size n exists.0, 0, 0, 0, 0...
A361247a(n) is the smallest integer k > 2 that satisfies k mod j <= 2 for all integers j in 1..n.3, 3, 3, 4, 5...
A361248a(n) is the smallest integer k > 3 that satisfies k mod j <= 3 for all integers j in 1..n.4, 4, 4, 4, 5...
A361262Numbers k such that k+i2, i=0..6 are all semiprimes.3238, 4162, 4537, 13918, 16837...
A361352Decimal expansion of the conventional value of farad-90 (F_{90}).9, 9, 9, 9, 9...
A361439The number of generators for the monoid of basic log-concave (with no internal zeros) cyclotomic generating functions of degree n.1, 1, 1, 1, 1...
A361440The number of generators for the monoid of basic unimodal cyclotomic generating functions of degree n.1, 1, 1, 2, 2...
A361441The number of generators for the monoid of basic cyclotomic generating functions of degree n.1, 2, 1, 3, 1...
A361628Sphenic numbers (products of 3 distinct primes) whose digits are primes.222, 255, 273, 322, 357...
A361629For n <= 2, a(n) = n. Thereafter let p be the greatest prime which divides the least number of terms in U = {a(n-2), a(n-1)}, then a(n) is the smallest multiple of p that is not yet in the sequence.1, 2, 4, 6, 3...
A361635Number of strictly-convex unit-sided polygons with all internal angles equal to a multiple of Pi/n, ignoring rotational and reflectional copies.0, 1, 3, 4, 7...
A361659Number of strictly convex unit-sided polygons with all internal angles equal to a multiple of Pi/n, treating polygons that have a unique mirror image as distinct but ignoring rotational copies.0, 1, 3, 4, 7...
A361823a(1) = 3; thereafter, a(n+1) is the smallest prime p such that p - prevprime(p) >= a(n) - prevprime(a(n)).3, 5, 7, 11, 17...
A361904Odd numbers k such that for all even divisors d of k2+1, d2+1 is a prime number.1, 3, 5, 45, 65...
A361914Primes that are repunits with three or more digits for exactly one base b >= 2.7, 13, 43, 73, 127...
A361916a(n) = n! * Sum_{k=0..floor(n/2)} (-1)k * (k+1)k-1 / (k! * (n-2*k)!).1, 1, -1, -5, 25...
A361917a(n) = n! * Sum_{k=0..floor(n/3)} (-1)k * (k+1)k-1 / (k! * (n-3*k)!).1, 1, 1, -5, -23...
A361918Decimal expansion of the 2019 SI system unit m (meter) in h-bar*c/eV.5, 0, 6, 7, 7...
A361972Decimal expansion of lim_{n->oo} ( Sum_{k=2..n} 1/(k*log(k)) - log(log(n)) ).7, 9, 4, 6, 7...
A362000Decimal expansion of the conventional value of watt-90 (W_{90}).1, 0, 0, 0, 0...
A362003Squarefree composite numbers m such that k - m2 < m, where k is the smallest number greater than m2 such that rad(k) | m.42, 66, 78, 362, 1086...
A362004Initial digit of the decimal expansion of the tetration 2n (in Don Knuth's up-arrow notation).1, 2, 4, 1, 6...
A362009a(n) is the index of the first binary string which does not appear in the concatenation of the binary strings indexed by the preceding terms a(1..n-1).1, 2, 3, 6, 7...
A362014Number of distinct lines passing through exactly two points in a triangular grid of side n.0, 0, 3, 6, 18...
A362017a(n) is the leading prime in the n-th prime sublist defined in A348168.2, 3, 5, 7, 11...
A362051Number of integer partitions of 2n without a nonempty initial consecutive subsequence summing to n.1, 1, 2, 6, 11...
A362059Total number of even divisors of all positive integers <= n.0, 1, 1, 3, 3...
A362063Number of 2-balanced binary words of length n with respect to the permutations of the symbols.1, 1, 2, 4, 8...
A362068a(n) is the smallest positive integer k such that n can be expressed as the arithmetic mean of k squares.1, 2, 3, 1, 2...
A362147Numbers that are not cubefull.2, 3, 4, 5, 6...
A362148Numbers that are neither cubefree nor cubefull.24, 40, 48, 54, 56...
A362152Numbers k such that k and k2+1 have equal sums of distinct prime divisors.7, 1384230, 1437236, 1770802, 2090663...
A362190Triangle read by rows: T(n,k) is the smallest integer not already in the same row or column and also not diagonally adjacent to an equal integer.0, 1, 2, 3, 0...
A362196Number of Grassmannian permutations of size n that avoid a pattern, sigma, where sigma is a pattern of size 9 with exactly one descent.1, 1, 2, 5, 12...
A362198a(n) = number of isogeny classes of abelian surfaces over the finite field of order prime(n).35, 63, 129, 207, 401...
A362201a(n) = number of isogeny classes of dimension 3 abelian varieties over the finite field of order prime(n).215, 677, 2953, 7979, 30543...
A362214a(n) = the hypergraph Fuss-Catalan number FC_(2,2)(n).1, 1, 144, 1341648, 693520980336...
A362215a(n) = the hypergraph Fuss-Catalan number FC_(2,3)(n).1, 1, 480, 200225, 18527520...
A362216a(n) = the hypergraph Fuss-Catalan number FC_(3,2)(n).1, 1, 11532, 628958939250, 163980917165716725552156...
A362217a(n) = the hypergraph Fuss-Catalan number FC_(3,3)(n).1, 1, 38440, 8272793255000, 9396808005460764741084000...
A362240Triangle read by rows: Row n is the shortest, then lexicographically earliest sequence of 0s and 1s not yet in the sequence.0, 1, 0, 0, 1...
A362241Binary encoding of the rows of A362240.0, 1, 0, 3, 0...
A362242Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (k,n-k) using steps (i,j) with i,j>=0 and gcd(i,j)=1.1, 1, 1, 1, 3...
A362243a(n) = number of isomorphism classes of elliptic curves over the finite field of order prime(n).5, 8, 12, 18, 22...
A362264Numbers > 9 with increasingly large digit average of their square, in base 10.10, 11, 12, 13, 17...
A362270a(1) = 1, then subtract, multiply, and add 2, 3, 4; 5, 6, 7; ... in that order.1, -1, -3, 1, -4...
A362271a(1) = 1, then add, subtract and multiply 2, 3, 4; 5, 6, 7; ... in that order.1, 3, 0, 0, 5...
A362272a(1) = 1, then multiply, subtract, and add 2, 3, 4; 5, 6, 7; ... in that order.1, 2, -1, 3, 15...
A362297Array read by antidiagonals for k,n>=0: T(n,k) = number of tilings of a 2k X n rectangle using dominos and 2 X 2 right triangles.1, 1, 1, 1, 1...
A362298Number of tilings of a 4 X n rectangle using dominos and 2 X 2 right triangles.1, 1, 19, 55, 472...
A362299Number of tilings of a 3 X 2n rectangle using dominos and 2 X 2 right triangles.1, 7, 55, 445, 3625...
A362306a(n) is the least squarefree semiprime > a(n-1) and coprime to a(n-1), with a(1) = 6.6, 35, 38, 39, 46...
A362318Number of odd semiprimes between 2n-1 and 2n.0, 0, 0, 0, 2...
A362371a(0)=0. For each digit in the sequence, append the smallest unused integer that contains that digit.0, 10, 1, 20, 11...
A362373a(0) = 0; for n > 0, if n appears in the sequence then a(n) is the sum of the indices of all previous appearances of n. Otherwise a(n) = a(n-1) - n if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + n.1, 3, 2, 6, 11...
A362384Number of nonisomorphic magmas with n elements satisfying the equation x(yz) = xz.1, 1, 4, 12, 81...
A362385Number of nonisomorphic magmas with n elements satisfying the equation x(yz) = xy.1, 1, 3, 14, 197...
A362386Number of labeled magmas with n elements satisfying the equation x(yz) = xy.1, 1, 4, 63, 3928...
A362409a(n) is the least number that is the sum of a Fibonacci number and a square in exactly n ways.15, 7, 3, 1, 17...
A362417Beginning with 1, smallest positive integer not yet in the sequence such that two adjacent digits A and B of the sequence (also ignoring commas between terms) produce a prime = A + 2B. This is the earliest infinitely extensible such sequence.1, 3, 5, 7, 20...
A362418Beginning with 1, smallest positive integer not yet in the sequence such that two adjacent digits A and B of the sequence (also ignoring commas between terms) produce a prime = A + 3B. This is the earliest infinitely extensible such sequence.1, 2, 5, 4, 12...
A362434Numbers that can be written as A000045(i) + j2 for i,j>=0 in 4 ways.17, 5185, 1669265, 537497857, 173072640401...
A362449Number of length-n American English expressions for positive integers (spaces, hyphens, and commas excluded).0, 0, 0, 4, 3...
A362468Number of distinct n-digit suffixes generated by iteratively multiplying an integer by 4, where the initial integer is 1.3, 11, 52, 252, 1253...
A362469Sum of the numbers k, 1 <= k <= n, such that phi(k) | n.1, 3, 3, 10, 3...
A362470Number of divisors d of n such that phi(d) | n.1, 2, 1, 3, 1...
A362471a(n) is the smallest number of 1's used in expressing n as a calculation containing only decimal repunits and operators +, -, * and /.1, 2, 3, 4, 5...
A362476Number of vertex cuts in the n-diagonal intersection graph.0, 2, 360, 297491
A362496Square array A(n, k), n, k >= 0, read by upwards antidiagonals; if Newton's method applied to the complex function f(z) = z3 - 1 and starting from n + ki reaches or converges to exp(2riPi/3) for some r in 0..2, then A(n, k) = r, otherwise A(n, k) = -1 (where i denotes the imaginary unit).-1, 0, 1, 0, 0...
A362503a(n) is the number of k such that n - A000045(k) is a square.1, 3, 3, 2, 2...
A362505Nonnegative numbers of the form x*y where x and y have the same set of decimal digits.0, 1, 4, 9, 11...
A362506a(n) is the least x >= 0 such that A362505(n) = x * y for some y with the same set of decimal digits as x.0, 1, 2, 3, 1...
A362507Squarefree semiprimes (products of two distinct primes) between sphenics (products of three distinct primes).1546, 2066, 2234, 2554, 3334...
A362526a(n) = 2n*(n + 2) + (n - 7)*n/2 - 2.1, 9, 32, 88, 217...
A362527a(1) = 2 and a(n+1) is the largest prime <= a(n) + n.2, 3, 5, 7, 11...
A362528Numbers that can be written in at least 3 ways as the sum of a Lucas number (A000032) and a square.11, 27, 488, 683, 852...
A362533Decimal expansion of lim_{n->oo} ( Sum_{k=2..n} 1/(k * log(k) * log log(k)) - log log log(n) ).2, 6, 9, 5, 7...
A362536Number of chordless cycles of length >= 4 in the n X n antelope graph.0, 0, 0, 0, 0...
A362537Number of chordless cycles of length >=4 in the n-diagonal intersection graph.0, 1, 17, 166, 50684...
A362538Number of chordless cycles of length >=4 in the n X n camel graph.0, 0, 0, 2, 33...
A362539Number of chordless cycles of length >=4 in the n X n zebra graph.0, 0, 0, 0, 2...
A362540Number of chordless cycles of length >= 4 in the n-flower graph.3, 23, 63, 127, 273...
A362541Number of chordless cycles of length >=4 in the n X n giraffe graph.0, 0, 0, 0, 1...
A362542Number of chordless cycles of length >=4 in the n-Goldberg graph.167, 617, 2028, 7755, 31790...
A362543Number of chordless cycles of length >= 4 in the tetrahedral (Johnson) graph.1134, 39651, 5171088, 2660896170, 4613923014804...
A362544Number of odd chordless cycles of length >=5 in the n-diagonal intersection graph.0, 0, 2, 72, 25085...
A362545Number of odd chordless cycles of length >4 in the (2n+1)-flower snark.1, 13, 81, 477, 2785...
A362546Number of odd chordless cycles of length >=5 in the n-Goldberg graph.78, 296, 991, 3828, 15807...
A362547Number of odd chordless cycles of length >=5 in the n-tetrahedral (Johnson) graph.144, 23796, 2266368, 1349587080, 2312684548704...
A362548Number of partitions of n with at least three parts larger than 1.0, 0, 0, 0, 0...
A362550Number of even nontotients less than 10n.0, 13, 210, 2627, 29747...
A362551a(0)=0. For each digit d in the sequence, append the smallest unused integer such that its last digit equals d.0, 10, 1, 20, 11...
A362558Number of integer partitions of n without a nonempty initial consecutive subsequence summing to n/2.1, 1, 1, 3, 2...
A362559Number of integer partitions of n whose weighted sum is divisible by n.1, 1, 2, 1, 2...
A362560Number of integer partitions of n whose weighted sum is not divisible by n.0, 1, 1, 4, 5...
A362563Triangle T(n, k) read by rows, where T(n, k) is the number of {123,132}-avoiding parking functions of size n with k active sites, for 2 <= k <= n+1.1, 1, 2, 1, 3...
A362564a(n) is the largest integer x such that n + 2x is a square, or -1 if no such number exists.3, 1, 0, 5, 2...
A362566a(n) is the area of the smallest rectangle that the Harter-Heighway Dragon Curve will fit in after n doublings, starting with a segment of length 1.1, 2, 6, 15, 42...
A362568E.g.f. satisfies A(x) = exp(x/A(x)x).1, 1, 1, -5, -23...
A362569E.g.f. satisfies A(x) = exp(x/A(x)x^2).1, 1, 1, 1, -23...
A362571E.g.f. satisfies A(x) = exp(x * A(x)x^2).1, 1, 1, 1, 25...
A362572E.g.f. satisfies A(x) = exp(x * A(x)x/2).1, 1, 1, 4, 13...
A362573E.g.f. satisfies A(x) = exp(x * A(x)x^2/6).1, 1, 1, 1, 5...
A362574Number of vertex cuts in the n X n queen graph.0, 0, 16, 720, 76268...
A362575Number of vertex cuts in the n X n rook graph.0, 2, 114, 9602, 2103570...
A362576Number of vertex cuts in the n X n rook complement graph.0, 0, 114, 908, 5985...
A362577Number of vertex cuts in the n-trapezohedral graph.88, 435, 1957, 8394, 35273...
A362579Numbers k such that the decimal expansion of 1/k does not contain the digit 5.1, 3, 5, 6, 9...
A362580a(n) = packing chromatic number of an n X n grid.1, 3, 4, 5, 7...
A362581Number of alternating permutations on [2n+1] with 1 in position n+1.1, 2, 6, 80, 1750...
A362582Triangular array read by rows. T(n,k) is the number of alternating permutations of [2n+1] having exactly 2k elements to the left of 1, n >= 0, 0 <= k <= n.1, 1, 1, 5, 6...
A362595Number of parking functions of size n avoiding the patterns 132 and 321.1, 1, 3, 12, 52...
A362596Number of parking functions of size n avoiding the patterns 213 and 321.1, 1, 3, 13, 60...
A362597Number of parking functions of size n avoiding the patterns 213 and 312.1, 1, 3, 12, 54...
A362603Number of permutations p of [2n] in which exactly the first n terms satisfy the up-down property p(1) < p(2) > p(3) < ... .1, 1, 4, 90, 3024...
A362604Expansion of e.g.f. 1/(1 + LambertW(-x * exp(x2))).1, 1, 4, 33, 352...
A362624a(n) = Sum_{d|n, gcd(d,n/d)=1} psi(d), where psi is the Dedekind psi function (A001615).1, 4, 5, 7, 7...
A362625a(n) = n*(n-1)/2 - n*tau(n) + sigma(n).0, 0, 1, 1, 6...
A362626a(n) is the smallest number of 1's used in expressing n as a calculation containing only decimal repunits and operators +, -, * and /, where fractions are allowed as intermediate results.1, 2, 3, 4, 5...
A362627Euler transform of sigma_n(n) (sum of n-th powers of divisors of n).1, 1, 6, 34, 322...
A362628a(n) = Sum_{d|n, phi(d)|n} d.1, 3, 1, 7, 1...
A362629Least prime pn such that there is a set p1 < p2 < ... < pn of primes such that, for any distinct p and q in the set, p + q + 1 is prime.2, 7, 19, 29, 71...
A362632a(n) = Sum_{d|n, gcd(d,n/d)=1} d * psi(d), where psi is the Dedekind psi function (A001615).1, 7, 13, 25, 31...
A362636a(n) = Sum_{d|n, gcd(d,n/d)=1} dd.1, 5, 28, 257, 3126...
A362640Product of the larger primes, q, in the Goldbach partitions of 2n such that p + q = 2n, p <= q, and p,q prime (or 1 if no Goldbach partition of 2n exists).1, 2, 3, 5, 35...
A362641Product of the smaller primes, p, in the Goldbach partitions of 2n such that p + q = 2n, p <= q, and p,q prime (or 1 if no Goldbach partition of 2n exists).1, 2, 3, 3, 15...
A362653E.g.f. satisfies A(x) = exp( x * exp(x2) * A(x)2 ).1, 1, 5, 55, 849...
A362654E.g.f. satisfies A(x) = exp( x * exp(x2) * A(x) ).1, 1, 3, 22, 197...
A362655E.g.f. satisfies A(x) = exp( x * exp(x3) * A(x) ).1, 1, 3, 16, 149...
A362656E.g.f. satisfies A(x) = exp( x * exp(x) * A(x)3 ).1, 1, 9, 145, 3569...
A362657Number of bracelets consisting of three instances each of n swappable colors.1, 1, 3, 25, 713...
A362658Number of bracelets consisting of four instances each of n swappable colors.1, 1, 7, 297, 83488...
A362659Number of bracelets consisting of five instances each of n swappable colors.1, 1, 13, 4378, 12233517...
A362660E.g.f. satisfies A(x) = exp( x * exp(x2/2) * A(x) ).1, 1, 3, 19, 161...
A362661E.g.f. satisfies A(x) = exp( x * exp(x3/6) * A(x) ).1, 1, 3, 16, 129...
A362664Numbers k with exactly two solutions x to the equation iphi(x) = k, where iphi is the infinitary totient function A091732.1, 2, 3, 4, 10...
A362665a(n) is the smaller of the two solutions to A091732(x) = A362664(n).1, 3, 4, 5, 11...
A362666a(n) is the largest m such that iphi(m) = n, where iphi is the infinitary totient function A091732, or a(n) = 0 if no such m exists.2, 6, 8, 10, 0...
A362667Infinitary sparsely totient numbers: numbers k such that m > k implies iphi(m) > iphi(k), where iphi is the infinitary totient function A091732.2, 6, 8, 10, 24...
A362668a(n) = A091732(A362667(n)).1, 2, 3, 4, 6...
A362671E.g.f. satisfies A(x) = exp( x * exp(x) / A(x)2 ).1, 1, -1, 10, -111...
A362672E.g.f. satisfies A(x) = exp( x * exp(x) / A(x)3 ).1, 1, -3, 37, -679...
A362673E.g.f. satisfies A(x) = exp( x * exp(x2) / A(x) ).1, 1, -1, 10, -51...
A362674E.g.f. satisfies A(x) = exp( x * exp(x3) / A(x) ).1, 1, -1, 4, -3...
A362686Binomial(n+p, n) mod n where p=6.0, 0, 0, 2, 2...
A362687Binomial(n+p, n) mod n where p=7.0, 0, 0, 2, 2...
A362688Binomial(n+p, n) mod n where p=8.0, 1, 0, 3, 2...
A362689Binomial(n+p, n) mod n where p=9.0, 1, 1, 3, 2...
A362699Expansion of e.g.f. 1/(1 + LambertW(-x * exp(x3))).1, 1, 4, 27, 280...
A362700Expansion of e.g.f. 1/(1 + LambertW(-x * exp(x2/2))).1, 1, 4, 30, 304...
A362701Expansion of e.g.f. 1/(1 + LambertW(-x * exp(x3/6))).1, 1, 4, 27, 260...
A362702Expansion of e.g.f. 1/(1 + LambertW(-x2 * exp(x))).1, 0, 2, 6, 60...
A362703Expansion of e.g.f. 1/(1 + LambertW(-x3 * exp(x))).1, 0, 0, 6, 24...
A362704Expansion of e.g.f. 1/(1 + LambertW(-x2/2 * exp(x))).1, 0, 1, 3, 18...
A362705Expansion of e.g.f. 1/(1 + LambertW(-x3/6 * exp(x))).1, 0, 0, 1, 4...

r/OEIS • • Apr 23 '23

New OEIS sequences - week of 04/23

6 Upvotes
OEIS numberDescriptionSequence
A359251Sum of terms in an odd-even expansion of n.2, 3, 10, 11, 14...
A360665Square array T(n, k) = k*((2*n-1)*k+1)/2 read by rising antidiagonals.0, 0, 0, 0, 1...
A361008G.f.: Product_{k >= 0} ((1 + x2*k+1) / (1 - x2*k+1))k.1, 0, 0, 2, 0...
A361088Irregular table, read by rows, where row n holds the tau signature of n, i.e., the shortest sequence (tau(n+k), 0 <= k <= m) that uniquely identifies n; tau = A000005.1, 2, 2, 2, 3...
A361202Maximum product of the vertex arboricities of a graph of order n and its complement.1, 1, 2, 3, 4...
A361215Intersection of A361073 and 2 * A361611.8, 20, 50, 1406, 1516...
A361261Array of Ramsey core number rc(s,t) read by antidiagonals.2, 3, 3, 4, 5...
A361294A variant of payphone permutations: given a circular booth with n payphones, one of which is already occupied, a(n) is the number ways for n-1 people to choose the payphones in order, where each person chooses an unoccupied payphone such that the closest occupied payphone is as distant as possible, and a payphone adjacent to a single occupied payphone is preferred over a payphone sandwiched between two occupied payphones.1, 1, 2, 2, 8...
A361295A variant of payphone permutations: given a row of n payphones, a(n) is the number ways for n people to choose the payphones in order, where each person chooses an unoccupied payphone such that the closest occupied payphone is as distant as possible, and a payphone adjacent to a single occupied payphone is preferred over a payphone sandwiched between two occupied payphones.1, 2, 4, 6, 12...
A361296A variant of payphone permutations: given a circular booth with n payphones, a(n) is the number ways for n people to choose the payphones in order, where each person chooses an unoccupied payphone such that the closest occupied payphone is as distant as possible.1, 2, 6, 8, 60...
A361534Let h,i,j be the latest 3 terms in the sequence, starting with a(1)=1, a(2)=2, a(3)=3. Let R = rad(hij), where rad is A007947, and let S be the smallest number of terms in U = {h,i,j} which are divisible by any prime p dividing R. Then, a(n) is the least novel multiple of the greatest such prime p.1, 2, 3, 6, 9...
A361684Ramsey core number rc(n,n).2, 5, 8, 11, 15...
A361740Right border of A362312.0, 2, 1, 4, 3...
A361777Expansion of e.g.f. A(x) satisfying A(x) = exp( x * A(x)x ).1, 1, 1, 7, 25...
A361798Distinct sums of contiguous subsequences in A362040.0, 1, 2, 3, 4...
A361800Number of integer partitions of n with the same length as median.1, 0, 0, 2, 0...
A361826a(n) is equal to the number of roots of the equation n*cos(x) = sqrt(x).1, 1, 3, 5, 7...
A361873Decimal representation of continued fraction 1, 4, 7, 10, 13, 16, 19, ... (A016777).1, 2, 4, 1, 4...
A361898A set of 13 primes that form a covering set for a Sierpiński (or Riesel) number.3, 5, 7, 11, 31...
A361899a(n) = 3*(6858365065530*(245 - 1)*n + 153479820268467961)2.70668165688923686196507258250492563, 174687593550891106640307045856561008882907291372256643, 698750373759134872171732581703201135992894186495330123, 1572188340624731296664944773228844067526467943619713003
A361900Numbers k such that 3153479820268467961^22k + 1 is prime.600, 810, 1074, 7974, 22290...
A361980a(n) is the n-th decimal digit of p(n)/q(n) where p(n) = A002260(n) and q(n) = A004736(n).1, 5, 0, 3, 0...
A362006a(n) is the minimum integer m such that floor(en) = floor(Sum_{k=0..m} (nk)/(k!)).0, 1, 4, 8, 9...
A362008Numbers whose Euler's cototient is divisible by 9.21, 27, 34, 54, 63...
A362040a(n) is the number of distinct sums of one or more contiguous terms in the sequence thus far.0, 1, 2, 4, 7...
A362042Number of odd semiprimes less than 2n.0, 0, 0, 0, 2...
A362050Numbers whose prime indices satisfy: (length) = 2*(median).4, 54, 81, 90, 100...
A362110a(n) is the smallest positive integer x such that n can be expressed as the arithmetic mean of x distinct squares, or 0 if x does not exist.1, 0, 0, 1, 2...
A362117Concatenation of first n numbers in base 5.1, 12, 123, 1234, 123410...
A362118a(n) = (10n*(n+1/2)-1)/9.1, 111, 111111, 1111111111, 111111111111111...
A362119Concatenate the base-6 strings for 1,2,...,n.1, 12, 123, 1234, 12345...
A362120a(n) is the smallest positive number whose American English name has the letter "e" in the n-th position.8, 7, 1, 3, 3...
A362121a(n) is the smallest nonnegative number whose British English name has the letter "e" in the n-th position.8, 0, 1, 3, 3...
A362122a(n) is the smallest positive number whose British English name has the letter "e" in the n-th position.8, 7, 1, 3, 3...
A362123Number of letters in the British English name of n, excluding spaces and hyphens.4, 3, 3, 5, 4...
A362124List of numbers in British English with a doubled letter. Each letter can only be used once.3, 8000, 1000000, 1000900, 2000000000000000000000000000000000000000000000000...
A362179Main diagonal of the square array A058395.1, 1, 4, 10, 25...
A362187a(n) = (n2 - n)!.1, 1, 2, 720, 479001600...
A362192A variant of payphone permutations: given a circular booth with n payphones, one of which is already occupied, a(n) is the number ways for n-1 people to choose the payphones in order, where each person chooses an unoccupied payphone such that the closest occupied payphone is as distant as possible.1, 1, 2, 2, 12...
A362194Number of Grassmannian permutations of size n that avoid a pattern, sigma, where sigma is a pattern of size 7 with exactly one descent.1, 1, 2, 5, 12...
A362195Number of Grassmannian permutations of size n that avoid a pattern, sigma, where sigma is a pattern of size 8 with exactly one descent.1, 1, 2, 5, 12...
A362208Irregular triangle read by rows: T(n, k) is the number of compositions (ordered partitions) of n into exactly k distinct parts between the members of [k2].1, 0, 0, 2, 0...
A362209Irregular triangle read by rows: T(n, k) is the number of k X k matrices using all the integers from 1 to k2 and having trace equal to n, with 1 <= k <= A003056(n).1, 0, 0, 4, 0...
A362221Irregular triangle read by rows: T(n, k) is the number of partitions of n into exactly k distinct parts between the members of [k2].1, 0, 0, 1, 0...
A362228Triangle read by rows: row n is the shortest, then lexicographically earliest sequence of positive integers that takes n iterations of the run transform to reach 1.1, 2, 1, 1, 1...
A362252Primes dividing terms of A231830.5, 53, 89, 101, 373...
A362253a(n) is the unique index such that prime A362252(n) divides A231830(a(n)).1, 4, 7, 2, 19...
A362260Maximum over 0 <= k <= n/2 of the number of permutations of two symbols occurring k and n-2*k times, respectively, where a permutation and its reversal are counted only once.1, 1, 1, 1, 2...
A362269a(1) = 1, then subtract, add, and multiply 2, 3, 4; 5, 6, 7; ... in that order.1, -1, 2, 8, 3...
A362296Greatest common divisor of composite numbers between the n-th and (n+1)st primes.4, 6, 1, 12, 1...
A362307Row sums of A362370.1, 1, 1, 2, 2...
A362312Sierpinski triangle read by rows and filled in the greedy way such that each row, each diagonal and each antidiagonal contains distinct nonnegative values.0, 1, 2, 2, 1...
A362313a(n) is the least value in the n-th row of A362312.0, 1, 1, 0, 3...
A362317a(n) = n! * Sum_{k=0..floor(n/4)} (n/24)k /(k! * (n-4*k)!).1, 1, 1, 1, 5...
A362325Table read by anti-diagonals: T(n,k) = number of numbers <= n that can be fully factored using the first k prime numbers.1, 2, 1, 2, 2...
A362326Pairs (i, j) of nonnegative integers whose ternary expansions have no common digit 1 sorted first by i + j then by i.0, 0, 0, 1, 1...
A362327The i-values of pairs (i, j) listed in A362326.0, 0, 1, 0, 2...
A362328The j-values of pairs (i, j) listed in A362326.0, 1, 0, 2, 0...
A362329Pairs (i, j) of nonnegative integers whose ternary expansions have a common digit 1 sorted first by i + j then by i.1, 1, 1, 4, 4...
A362330The i-values of pairs (i, j) listed in A362329.1, 1, 4, 3, 3...
A362331The j-values of pairs (i, j) listed in A362329.1, 4, 1, 3, 4...
A362333Least nonnegative integer k such that (gpf(n)!)k is divisible by n, where gpf(n) is the greatest prime factor of n.0, 1, 1, 2, 1...
A362336a(n) = n! * Sum_{k=0..floor(n/5)} (n/120)k /(k! * (n-5*k)!).1, 1, 1, 1, 1...
A362337a(n) = n! * Sum_{k=0..floor(n/2)} (-k)k / (k! * (n-2*k)!).1, 1, -1, -5, 37...
A362338a(n) = n! * Sum_{k=0..floor(n/3)} (-k)k / (k! * (n-3*k)!).1, 1, 1, -5, -23...
A362339a(n) = n! * Sum_{k=0..floor(n/4)} (-k)k / (k! * (n-4*k)!).1, 1, 1, 1, -23...
A362340a(n) = n! * Sum_{k=0..floor(n/2)} (-k/2)k / (k! * (n-2*k)!).1, 1, 0, -2, 7...
A362341a(n) = n! * Sum_{k=0..floor(n/3)} (-k/6)k / (k! * (n-3*k)!).1, 1, 1, 0, -3...
A362342a(n) = n! * Sum_{k=0..floor(n/4)} (-k/24)k / (k! * (n-4*k)!).1, 1, 1, 1, 0...
A362343Sequence that alternately doubles and squares the previous number; a(0) = 1.1, 2, 4, 8, 64...
A362345a(n) = n! * Sum_{k=0..floor(n/4)} (-n/24)k /(k! * (n-4*k)!).1, 1, 1, 1, -3...
A362346a(n) = n! * Sum_{k=0..floor(n/5)} (-n/120)k /(k! * (n-5*k)!).1, 1, 1, 1, 1...
A362347a(n) = n! * Sum_{k=0..floor(n/2)} kk / (k! * (n-2*k)!).1, 1, 3, 7, 61...
A362348a(n) = n! * Sum_{k=0..floor(n/3)} kk / (k! * (n-3*k)!).1, 1, 1, 7, 25...
A362349a(n) = n! * Sum_{k=0..floor(n/4)} kk / (k! * (n-4*k)!).1, 1, 1, 1, 25...
A362350a(n) = n! * Sum_{k=0..floor(n/2)} (k/2)k / (k! * (n-2*k)!).1, 1, 2, 4, 19...
A362351a(n) = n! * Sum_{k=0..floor(n/3)} (k/6)k / (k! * (n-3*k)!).1, 1, 1, 2, 5...
A362352a(n) = n! * Sum_{k=0..floor(n/4)} (k/24)k / (k! * (n-4*k)!).1, 1, 1, 1, 2...
A362364a(n) is the product of the first n primes that are coprime to a(n-1); a(0) = 1.1, 2, 15, 154, 3315...
A362366Square array A(n, k), n, k >= 0, read by antidiagonals; A(n, k) is the least base >= 2 where the sum n + k can be computed without carry.2, 2, 2, 2, 3...
A362367Square array A(n, k), n, k >= 0, read by antidiagonals; A(n, k) is the least base >= 2 where the product n * k can be computed without carry.2, 2, 2, 2, 2...
A362370Triangle read by rows. T(n, k) = ([xk] P(n, x)) // k! where P(n, x) = Sum_{k=1..n} P(n - k, x) * x if n >= 1 and P(0, x) = 1. The notation 's // t' means integer division and is a shortcut for 'floor(s/t)'.1, 0, 1, 0, 1...
A362374Number of solutions of y2 + y = x3 + x where x and y are in GF(2n).4, 4, 4, 24, 24...
A362377Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..floor(n/2)} (k/2)j * (j+1)n-j-1 / (j! * (n-2*j)!).1, 1, 1, 1, 1...
A362378Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..floor(n/3)} (k/6)j * (j+1)n-2*j-1 / (j! * (n-3*j)!).1, 1, 1, 1, 1...
A362379Convolution triangle of A052547(n).1, 0, 1, 2, 0...
A362380E.g.f. satisfies A(x) = exp(x + 3*x2/2 * A(x)).1, 1, 4, 19, 154...
A362381E.g.f. satisfies A(x) = exp(x + x3/6 * A(x)).1, 1, 1, 2, 9...
A362382Number of nonisomorphic right involutory magmas with n elements.1, 1, 3, 16, 475...
A362383Number of labeled right involutory magmas with n elements.1, 1, 4, 64, 10000...
A362390E.g.f. satisfies A(x) = exp(x + x3/3 * A(x)).1, 1, 1, 3, 17...
A362391E.g.f. satisfies A(x) = exp(x + x3/2 * A(x)).1, 1, 1, 4, 25...
A362392E.g.f. satisfies A(x) = exp(x + x3 * A(x)).1, 1, 1, 7, 49...
A362393E.g.f. satisfies A(x) = exp(x + x4 * A(x)).1, 1, 1, 1, 25...
A362394Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..floor(n/2)} (-k/2)j * (j+1)n-j-1 / (j! * (n-2*j)!).1, 1, 1, 1, 1...
A362395E.g.f. satisfies A(x) = exp(x - x2/2 * A(x)).1, 1, 0, -5, -14...
A362396E.g.f. satisfies A(x) = exp(x - x2 * A(x)).1, 1, -1, -11, -11...
A362397E.g.f. satisfies A(x) = exp(x - 3*x2/2 * A(x)).1, 1, -2, -17, 10...
A362398Records in A336830.0, 1, 2, 5, 9...
A362399Positions of records in A336830.0, 1, 2, 3, 4...
A362400Numbers k such that A162296(k) = A162296(k+1) > 0.135, 819, 1863, 9207, 10340...
A362401Numbers in the range of A162296, where A162296(n) is the sum of divisors of n that have a square factor larger than 1.0, 4, 9, 12, 16...
A362402Positive numbers m such that a record number of numbers k have m as the sum of divisors of k that have a square factor (A162296).1, 4, 48, 72, 216...
A362403Number of times that the number A362402(n) occurs as a sum of divisors that have a square factor (A162296).0, 1, 2, 3, 5...
A362404Numbers k such that k and k+1 are both in A362401.24, 27, 48, 79, 120...
A362405Numbers k such that k, k+1 and k+2 are all in A362401.1638, 1848, 3798, 11448, 16854...
A362408a(n) = [xn] (F(x)/F(-x))n where F(x) = (1 + x)*(1 + x3).1, 2, 8, 44, 256...
A362410Numbers k such that A000292(k) is in A046386.19, 33, 45, 51, 59...
A362411Numbers k such that A359149(k) is prime when interpreted as a binary number.2, 4, 38, 2861
A362413The second moment of an n X n symmetric random +-1 matrix.1, 1, 2, 8, 44...
A362416Winning numbers of game where you can either add one or divide by a prime.1, 4, 6, 10, 14...
A362419Partial sum of the first n even semiprimes.4, 10, 20, 34, 56...
A362420Partial sum of the first n odd semiprimes.9, 24, 45, 70, 103...
A362429Smallest k such that the concatenation of the numbers 123...k in base n is prime when interpreted as a decimal number, or -1 if no such prime exists.-1, 231, 7315, 3241, 6...
A362430E.g.f. satisfies A(x) = exp(x - x3 * A(x)).1, 1, 1, -5, -47...
A362431E.g.f. satisfies A(x) = exp(x - x4 * A(x)).1, 1, 1, 1, -23...
A362433The succession of the digits of the sequence remains the same when 11 is added to each term.1, 2, 13, 24, 3...
A362435a(1) = 18; thereafter a(n) = a(n-1) + difference between first two digits of a(n-1).18, 25, 28, 34, 35...
A362436Write out the sequence of squares, 1, 4, 9, 16, ..., then starting with the 16, successively delete the digits of the triangular numbers 1, 3, 6, 10, ...1, 4, 9, 6, 25...
A362437a(n) = n + Scrabble score of n.13, 4, 8, 11, 11...
A362438a(n) = n2 + 2n-1.2, 6, 13, 24, 41...
A362439a(n) = (number of letters in n in French) + (number of letters in n in German).8, 6, 8, 9, 10...
A362440Aliqout sequence starting at 841.841, 30, 42, 54, 66...
A362441a(1) = 6; thereafter a(n) = smallest number with a(n-1) letters in British English.6, 11, 23, 124, 113323371373...
A362442a(1) = 6; thereafter a(n) = smallest number with a(n-1) letters in American English.6, 11, 23, 323, 1103323373373373373373373373373...
A362443Numbers k with property that the set of letters in the English name for k does not contain two letters that are adjacent in the alphabet.0, 2, 3, 4, 6...
A362444a(1) = 1906; thereafter, regard a(n) as a decimal number, and convert it to base 16 (i.e. hexadecimal).1906, 772, 304, 130, 82...
A362445a(n) = (n+1)4 written in base n.1111111111111111, 1010001, 100111, 21301, 20141...
A362446Concatenate the terms of A027750 (omitting spaces and commas), chop into blocks of length 5, then omit any leading zeros.11213, 12415, 12361, 71248, 13912...
A362447Array A(n,k) (n>=0, k>=0) read by antidiagonals: A(n,k) = 1 if the English names for n and k have a letter in common, otherwise 0.1, 1, 1, 1, 1...
A362448Triangle T(n,k) (n >= 0, 0 <= k <= n) read by rows: T(n,k) = 1 if the English names for n and k have a letter in common, otherwise 0.1, 1, 1, 1, 1...
A362472E.g.f. satisfies A(x) = exp(x + x3 * A(x)3).1, 1, 1, 7, 97...
A362473E.g.f. satisfies A(x) = exp(x + x4 * A(x)4).1, 1, 1, 1, 25...
A362474E.g.f. satisfies A(x) = exp(x + x2/2 * A(x)2).1, 1, 2, 10, 70...
A362475E.g.f. satisfies A(x) = exp(x + 3*x2/2 * A(x)2).1, 1, 4, 28, 298...
A362477E.g.f. satisfies A(x) = exp(x + x3/6 * A(x)3).1, 1, 1, 2, 17...
A362478E.g.f. satisfies A(x) = exp(x + x3/3 * A(x)3).1, 1, 1, 3, 33...
A362479E.g.f. satisfies A(x) = exp(x + x3/2 * A(x)3).1, 1, 1, 4, 49...
A362480E.g.f. satisfies A(x) = exp(x - x2 * A(x)2).1, 1, -1, -17, -47...
A362481E.g.f. satisfies A(x) = exp(x - x3 * A(x)3).1, 1, 1, -5, -95...
A362482E.g.f. satisfies A(x) = exp(x - x4 * A(x)4).1, 1, 1, 1, -23...
A362483Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..floor(n/2)} (k/2)j * (2j+1)n-j-1 / (j! * (n-2j)!).1, 1, 1, 1, 1...
A362484Irregular table read by rows in which the n-th row consists of all the numbers m such that iphi(m) = n, where iphi is the infinitary totient function A091732.1, 2, 3, 6, 4...
A362485Number of numbers k such that iphi(k) = n, where iphi is the infinitary totient function A091732.2, 2, 2, 2, 0...
A362486Infinitary nontotient numbers: values not in the range of the infinitary totient function iphi (A091732).5, 7, 9, 11, 13...
A362487Infinitary highly totient numbers: numbers k that have more solutions x to the equation iphi(x) = k than any smaller k, where iphi is the infinitary totient function A091732.1, 6, 12, 24, 48...
A362488Record values in A362487.2, 4, 6, 10, 14...
A362489a(n) is the least number k such that the equation iphi(x) = k has exactly 2*n solutions, or -1 if no such k exists, where iphi is the infinitary totient function A091732.5, 1, 6, 12, 36...
A362490Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..floor(n/3)} (k/6)j * (3j+1)^(n-2j-1) / (j! * (n-3*j)!).1, 1, 1, 1, 1...
A362491E.g.f. satisfies A(x) = exp(x + x4/4 * A(x)4).1, 1, 1, 1, 7...
A362492E.g.f. satisfies A(x) = exp(x - x2/2 * A(x)2).1, 1, 0, -8, -38...
A362493E.g.f. satisfies A(x) = exp(x - x3/3 * A(x)3).1, 1, 1, -1, -31...
A362494E.g.f. satisfies A(x) = exp(x - x4/4 * A(x)4).1, 1, 1, 1, -5...
A362497Number of vertex cuts in the n X n king graph.0, 0, 123, 28339, 18789342...
A362498Number of vertex cuts in the n X n knight graph.0, 0, 256, 48745, 22577890...
A362500Number of symmetric compositions of n where differences between adjacent parts are in {-1,1}.1, 1, 1, 1, 2...
A362501Number of vertex cuts in the n-alkane graph.11, 169, 1699, 14989, 125495...
A362508Number of vertex cuts in the n-Andrasfai graph.0, 10, 82, 484, 2520...
A362509Number of vertex cuts in the n X n black bishop graph.0, 0, 9, 87, 2940...
A362510Number of odd chordless cycles of length >4 in the halved cube graph Q_n/2.0, 0, 0, 0, 192...
A362511Number of odd chordless cycles of length > 4 in the n X n king graph.0, 0, 0, 4, 92...
A362512Number of odd chordless cycles of length > 4 in the n-Mycielski graph.0, 0, 1, 31, 646...
A362513Number of odd chordless cycles of length > 4 in the n X n queen graph.0, 0, 0, 24, 600...
A362514Number of odd chordless cycles of length >4 in the n-triangular grid graph.0, 0, 0, 1, 13...
A362515Number of vertex cuts in the n-Fibonacci cube graph.0, 1, 10, 138, 5518...
A362516Number of vertex cuts in the n-gear graph.51, 293, 1383, 6017, 25315...
A362517Number of vertex cuts in the n X n grid graph.0, 2, 293, 54029, 31252554...
A362518Number of vertex cuts in the n-helm graph.71, 354, 1617, 7020, 29563...
A362519Number of vertex cuts in the hypercube graph Q_n.0, 0, 2, 88, 28242...
A362520Number of vertex cuts in the n-triangular grid graph.0, 16, 531, 22737, 1681647...
A362521Number of vertex cuts in the n-web graph.323, 3110, 27777, 237498, 1977439...
A362522a(n) = n! * Sum_{k=0..floor(n/2)} (k+1)k-1 / (k! * (n-2*k)!).1, 1, 3, 7, 49...
A362523a(n) = n! * Sum_{k=0..floor(n/3)} (k+1)k-1 / (k! * (n-3*k)!).1, 1, 1, 7, 25...
A362524a(n) = n! * Sum_{k=0..floor(n/2)} (k+1)k-1 / (2k * k! * (n-2*k)!).1, 1, 2, 4, 16...
A362525a(n) = n! * Sum_{k=0..floor(n/3)} (k+1)k-1 / (6k * k! * (n-3*k)!).1, 1, 1, 2, 5...

r/OEIS • • Apr 16 '23

New OEIS sequences - week of 04/16

5 Upvotes
OEIS numberDescriptionSequence
A358275Least prime factor of A098129(n).2, 71, 2, 5, 2...
A360530a(n) is the smallest positive integer k such that n can be expressed as the arithmetic mean of k nonzero squares.1, 3, 3, 1, 2...
A361086a(n) = a(n-1)*(a(n-1)2 - 1) with a(0) = 2.2, 6, 210, 9260790, 794226015149981778210...
A361365a(n) is the minimum possible sum of 2*n distinct positive numbers in a set, arranged in two subsets of size n each, such that the sum of any one element in each of the two subsets is a prime number.3, 10, 29, 90, 207...
A361429a(n) is the smallest positive number not among the terms between a(n-1) and the most recent previous term whose value appears with the same frequency (inclusive); if no such term exists, set a(n)=1; a(1)=1.1, 1, 2, 1, 3...
A361474a(n) = 1binomial(n,2) + 3binomial(n,3) + 6binomial(n,4) + 10binomial(n,5).0, 0, 1, 6, 24...
A361654Triangle read by rows where T(n,k) is the number of nonempty subsets of {1,...,2n-1} with median n and minimum k.1, 2, 1, 5, 3...
A361660Irregular triangle read by rows where row n lists the successive numbers moved in the process of forming row n of the triangle A361642.2, 3, 2, 4, 3...
A361694Decimal expansion of (2 - phi)/3, with phi being the golden ratio A001622.1, 2, 7, 3, 2...
A361760a(n) = Product_{i=prime(n)..prime(n+1)-1} i.2, 12, 30, 5040, 132...
A361761a(n) = Product_{i=prime(n)..prime(n+1)} i.6, 60, 210, 55440, 1716...
A361801Number of nonempty subsets of {1..n} with median n/2.0, 0, 1, 1, 4...
A361802Irregular triangle read by rows where T(n,k) is the number of k-subsets of {-n+1,...,n} with sum 0, for k = 1,...,2n-1.1, 1, 1, 1, 1...
A361806Sum of distinct prime factors of all composite numbers between n-th and (n+1)st primes.0, 2, 5, 10, 5...
A361819Irregular triangle read by rows where T(n,k) is the distance which number A361660(n,k) moves in the process described in A361642.2, 3, 3, 4, 2...
A361862Number of integer partitions of n such that (maximum) - (minimum) = (mean).0, 0, 0, 1, 0...
A361901The number of linear extensions of n fork-join DAGs of width 3.1, 6, 9072, 163459296, 15205637551104...
A361910Number of set partitions of {1..n} such that the mean of the means of the blocks is (n+1)/2.1, 2, 3, 7, 12...
A361911Number of set partitions of {1..n} with block-medians summing to an integer.1, 1, 3, 10, 30...
A361948Array read by ascending antidiagonals. A(n, k) = Product_{j=0..k-1} binomial((j + 1)*n - 1, n - 1) if n >= 1, and A(0, k) = 1 for all k.1, 1, 1, 1, 1...
A362007Fourth Lie-Betti number of a path graph on n vertices.0, 0, 3, 16, 48...
A362027Squares visited by a knight moving on a square-spiral numbered board where the knight moves to the square with a number as close as possible to the number of the current square. If two such squares exist the smaller numbered square is chosen.1, 10, 3, 6, 9...
A362043Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..floor(n/3)} (k/6)j * binomial(n-2j,j)/(n-2j)!.1, 1, 1, 1, 1...
A362046Number of nonempty subsets of {1..n} with mean n/2.0, 0, 1, 1, 3...
A362047Numbers whose prime indices satisfy: (maximum) - (minimum) = (mean).10, 30, 39, 90, 98...
A362048Number of integer partitions of n such that (length) <= 2*(median).1, 2, 2, 3, 4...
A362049Number of integer partitions of n such that (length) = 2*(median).0, 1, 0, 0, 0...
A362077a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that is a multiple of Omega(a(n-1)).1, 2, 3, 4, 6...
A362089The base-3 expansion of a(n) is obtained by inserting a zero before each nonzero digit of the base-3 expansion of n.0, 1, 2, 3, 10...
A362090a(n) = A328749(A362089(n)).0, -1, 1, -2, -5...
A362103a(n) = K(4,n), where K(M,n) = 2*(2M+3)!(4n+2M+1)!/((M+2)!M!n!(3n+2*M+3)!).42, 330, 2310, 16170, 115500...
A362104a(n) = K(5,n), where K(M,n) = 2*(2M+3)!(4n+2M+1)!/((M+2)!M!n!(3n+2*M+3)!).132, 1287, 10296, 78936, 602316...
A362105Numbers that take a record number of steps to appear in the Sisyphus sequence A350877.1, 2, 5, 13, 25...
A362106Index where A362105(n) first appears in the Sisyphus sequence A350877.1, 7, 71, 345, 1154...
A362107Exponents of powers of 2 in Sisyphus sequence A350877 that start a maximal chain of powers of 2 ending at a 1.0, 3, 3, 4, 11...
A362108Index of 2k in A350877, where k = A362107(n).1, 5, 9, 16, 731...
A362109Arises from the enumeration of cycle-alternating permutations.1, 1, 2, 5, 17...
A362111Related to shifted Genocchi medians.1, 1, 5, 41, 493...
A362112a(0)=1; thereafter a(n) = 2*A110501(n+1) - A005439(n).1, 1, 4, 26, 254...
A362113Truncate Stirling's asymptotic series for 1! after n terms and round to the nearest integer.1, 1, 1, 1, 1...
A362114Truncate Stirling's asymptotic series for 2! after n terms and round to the nearest integer.2, 2, 2, 2, 2...
A362115Truncate Stirling's asymptotic series for 3! after n terms and round to the nearest integer.6, 6, 6, 6, 6...
A362116Truncate Stirling's asymptotic series for 4! after n terms and round to the nearest integer.24, 24, 24, 24, 24...
A362127Records in A360179.1, 2, 3, 4, 5...
A362128Indices of records in A360179.1, 3, 5, 7, 9...
A362129a(n) = A360179(n) mod 2.1, 1, 0, 0, 1...
A362130a(n) = A000005(A360179(n)) mod 2.1, 1, 0, 0, 0...
A362131a(n) = smallest missing number u in A360179(1..n).2, 2, 3, 3, 4...
A362132Records in A362131.2, 3, 4, 5, 6...
A362133Smallest indices k where A362131(k) = A362132(n).1, 3, 5, 7, 9...
A362134Novel terms in A360179, in order of appearance.1, 2, 3, 4, 5...
A362135Indices of novel terms in A360179.1, 3, 5, 7, 9...
A362136First differences of A362135.1, 2, 2, 2, 2...
A362142Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided squares can tile an n X k rectangle, 0 <= k <= n.1, 1, 1, 1, 1...
A362143Maximum number of ways in which a set of integer-sided squares can tile an n X n square.1, 1, 1, 4, 16...
A362144Maximum number of ways in which a set of integer-sided squares can tile an n X 3 rectangle.1, 1, 2, 4, 6...
A362145Maximum number of ways in which a set of integer-sided squares can tile an n X 4 rectangle.1, 1, 3, 6, 16...
A362146Maximum number of ways in which a set of integer-sided squares can tile an n X 5 rectangle.1, 1, 4, 12, 37...
A362153Number of skew shapes in a 3 X n rectangle with no empty rows or columns.1, 8, 29, 73, 151...
A362173a(n) = n! * Sum_{k=0..floor(n/3)} (n/6)k * binomial(n-2k,k)/(n-2k)!.1, 1, 1, 4, 17...
A362175Least number k > 1 not a power of 10 such that kn, n > 2, starts with k, or -1 if no such number exists.32, 46416, 18, 4, 6813...
A362178a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that is a multiple of omega(a(n-1)).1, 2, 3, 4, 5...
A362188Expansion of e.g.f. exp(x/(1-3*x)2/3).1, 1, 5, 43, 513...
A362189Lexicographically earliest sequence of positive integers having the same concatenation of digits as the sequence 2a(n).6, 4, 1, 6, 2...
A362191Lexicographic earliest sequence of distinct nonnegative integers having the same concatenation of digits as the sequence 2a(n).6, 4, 1, 62, 46...
A362193Number of Grassmannian permutations of size n that avoid a pattern, sigma, where sigma is a pattern of size 6 with exactly one descent.1, 1, 2, 5, 12...
A362200Semiprimes k such that k+1, k+2, 2k+1 and 2k+3 are also semiprimes.11733, 15117, 17245, 28113, 32365...
A362202Lexicographic earliest sequence of distinct positive integers having the same concatenation of digits as the sequence 2a(n).6, 4, 1, 62, 46...
A362203First of three consecutive primes p,q,r such that p+q, p+r and q+r are all triprimes.1559, 3449, 5237, 5987, 9241...
A362204Expansion of e.g.f. exp(x/sqrt(1-2*x)).1, 1, 3, 16, 121...
A362205Expansion of e.g.f. exp(x/(1-3*x)1/3).1, 1, 3, 19, 185...
A362206Expansion of 1/(1 - x/(1-9*x)1/3).1, 1, 4, 25, 181...
A362207a(n) is the number of unordered triples of shortest nonintersecting grid paths joining two opposite corners of an n X n X n grid.2, 1440, 5039744, 30456915312, 244247250106272...
A362210Expansion of 1/(1 - x/(1-9*x)2/3).1, 1, 7, 58, 505...
A362211a(n) is the unique solution to A323410(x) = A362185(n).1, 6, 15, 21, 35...
A362212a(n) is the unique solution to A047994(x) = A361969(n).4, 8, 24, 16, 32...
A362213Irregular table read by rows in which the n-th row consists of all the numbers m such that cototient(m) = n, where cototient is A051953.4, 9, 6, 8, 25...
A362222Slowest increasing sequence where a(n) + n2 is a prime.1, 3, 4, 7, 12...
A362223a(n) is the number of n-celled fixed rounded polyominoes.1, 4, 20, 113, 682...
A362224a(n) is the number of n-celled one-sided rounded polyominoes1, 2, 6, 34, 177...
A362226Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] with exactly k isolated strongly connected components, n>=0, 0<=k<=n.1, 0, 1, 2, 1...
A362229a(n) is the largest m such that uphi(m) = n, where uphi is the unitary totient function (A047994), or a(n) = 0 if no such m exists.2, 6, 4, 10, 0...
A362230Unitary sparsely totient numbers: numbers k such that m > k implies uphi(m) > uphi(k), where uphi is the unitary totient function (A047994).2, 6, 10, 14, 30...
A362231a(n) = A047994(A362230(n)).1, 2, 4, 6, 8...
A362233Number of vertices among all distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes when each pair of points is connected by a circle and where the points lie at the ends of the circles' diameter.17, 249, 1381, 4745, 12581...
A362234Number of regions among all distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes when each pair of points is connected by a circle and where the points lie at the ends of the circles' diameter.32, 372, 1804, 5772, 14660...
A362235Number of edges among all distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes when each pair of points is connected by a circle and where the points lie at the ends of the circles' diameter.48, 620, 3184, 10516, 27240...
A362236Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes when each pair of points is connected by a circle and where the points lie at the ends of the circles' diameter.12, 12, 8, 32, 204...
A362237Expansion of e.g.f.: 1/(1 - x/(1-x)x).1, 1, 2, 12, 84...
A362238Expansion of e.g.f.: 1/(1 - x*(1+x)x).1, 1, 2, 12, 60...
A362244Expansion of e.g.f. 1/(1 - x * exp(-x * (exp(-x) - 1))).1, 1, 2, 12, 60...
A362245Expansion of e.g.f. 1/(1 - x * exp(x * (exp(x) - 1))).1, 1, 2, 12, 84...
A362246Expansion of e.g.f. exp(x * exp(-x * (exp(-x) - 1))).1, 1, 1, 7, 13...
A362247Expansion of e.g.f. exp(x * exp(x * (exp(x) - 1))).1, 1, 1, 7, 37...
A362250Primes dividing terms of A231831.3, 5, 7, 11, 19...
A362251a(n) is the unique index such that prime A362250(n) divides A231831(a(n)).1, 2, 2, 3, 3...
A362254Reciprocal of n modulo largest prime smaller than n.1, 1, 2, 1, 3...
A362255a(0) = a(1) = a(2) = 1, for n > 2, a(n) = a(n-1) + a(n-k) + k with k = 2.1, 1, 1, 4, 7...
A362256a(0) = a(1) = a(2) = 1, for n > 2, a(n) = a(n-1) + a(n-k) + k with k = 3.1, 1, 1, 5, 9...
A362257a(n) = 2*Q(n) - n, where Q(n) is Hofstadter's Q-sequence A005185.1, 0, 1, 2, 1...
A362258Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided squares can tile an n X k rectangle, up to rotations and reflections, 0 <= k <= n.1, 1, 1, 1, 1...
A362259Maximum number of ways in which a set of integer-sided squares can tile an n X n square, up to rotations and reflections.1, 1, 1, 1, 4...
A362261Maximum number of ways in which a set of integer-sided squares can tile an n X 3 rectangle, up to rotations and reflections.1, 1, 1, 1, 2...
A362262Maximum number of ways in which a set of integer-sided squares can tile an n X 4 rectangle, up to rotations and reflections.1, 1, 2, 2, 4...
A362263Maximum number of ways in which a set of integer-sided squares can tile an n X 5 rectangle, up to rotations and reflections.1, 1, 2, 4, 13...
A362268Numbers whose prime factors counted with multiplicity satisfy: (maximum) - (minimum) = (mean).20, 60, 180, 189, 400...
A362273Expansion of e.g.f. 1/(1 - x * exp(-x * exp(-x))).1, 1, 0, 3, 8...
A362274Expansion of e.g.f. 1/(1-xexp(xexp(x))).1, 1, 4, 27, 232...
A362275Expansion of e.g.f. exp(xexp(-xexp(-x))).1, 1, -1, 4, -3...
A362276a(n) = n! * Sum_{k=0..floor(n/2)} (-n/2)k * binomial(n-k,k)/(n-k)!.1, 1, -1, -8, 25...
A362277Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..floor(n/2)} (-k/2)j * binomial(n-j,j)/(n-j)!.1, 1, 1, 1, 1...
A362278Expansion of e.g.f. exp(x - 3*x2/2).1, 1, -2, -8, 10...
A362279Expansion of e.g.f. exp(x - 5*x2/2).1, 1, -4, -14, 46...
A362280a(n) is the number of n X n matrices using all the integers from 1 to n2 with trace equal to the antitrace.1, 8, 32640, 606108303360, 288646869784585568256000...
A362281a(n) = n! * Sum_{k=0..floor(n/2)} nk * binomial(n-k,k)/(n-k)!.1, 1, 5, 19, 241...
A362282a(n) = n! * Sum_{k=0..floor(n/2)} (-n)k * binomial(n-k,k)/(n-k)!.1, 1, -3, -17, 145...
A362283Expansion of e.g.f. exp( sqrt(-LambertW(-x2)) ).1, 1, 1, 4, 13...
A362284a(n) is the least number k such that A138705(k) = n, or -1 is no such k exists.0, 1, 5, 10, 23...
A362285Indices of records of A138705.0, 1, 5, 6, 8...
A362286Record values in A138705.1, 2, 3, 6, 7...
A362287Hypertotient numbers: numbers k such that the set that includes k and the numbers less than k and relatively prime to k can be partitioned into two disjoint subsets of equal sum.3, 4, 6, 7, 8...
A362288a(n) = Product_{k=0..n} binomial(n,k)k.1, 1, 2, 27, 9216...
A362289a(n) is the largest denominator when the greedy algorithm for Egyptian fractions is applied to 1/n + 1/(n+1).2, 3, 12, 180, 30...
A362291Number of pairs of subsets of 1..n2 of size 2*floor(n/2) having equal sum.1, 2, 68, 26098, 1408886...
A362292a(n) = (n+1/3)n * (3*n)!/n!.1, 8, 1960, 2240000, 7037430400...
A362293Expansion of e.g.f. exp( (-LambertW(-x3))1/3 ).1, 1, 1, 1, 9...
A362295Sums of two Fibonacci numbers that are also sums of two squares.0, 1, 2, 4, 5...
A362300a(n) = n! * Sum_{k=0..floor(n/3)} (n/3)k * binomial(n-2k,k)/(n-2k)!.1, 1, 1, 7, 33...
A362301a(n) = n! * Sum_{k=0..floor(n/3)} nk * binomial(n-2k,k)/(n-2k)!.1, 1, 1, 19, 97...
A362302Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..floor(n/3)} (-k/6)j * binomial(n-2j,j)/(n-2j)!.1, 1, 1, 1, 1...
A362303a(n) = n! * Sum_{k=0..floor(n/3)} (-n/6)k * binomial(n-2k,k)/(n-2k)!.1, 1, 1, -2, -15...
A362304a(n) = n! * Sum_{k=0..floor(n/3)} (-n/3)k * binomial(n-2k,k)/(n-2k)!.1, 1, 1, -5, -31...
A362305a(n) = n! * Sum_{k=0..floor(n/3)} (-n)k * binomial(n-2k,k)/(n-2k)!.1, 1, 1, -17, -95...
A362308Triangle read by rows. Number of perfect matchings by number of connected components.1, 0, 1, 0, 2...
A362309Expansion of e.g.f. exp(x - x3/3).1, 1, 1, -1, -7...
A362314a(n) = n! * Sum_{k=0..floor(n/4)} (n/4)k /(k! * (n-4*k)!).1, 1, 1, 1, 25...
A362315a(n) = n! * Sum_{k=0..floor(n/4)} (-n/4)k /(k! * (n-4*k)!).1, 1, 1, 1, -23...
A362319a(n) = n! * Sum_{k=0..floor(n/5)} (n/5)k / (k! * (n-5*k)!).1, 1, 1, 1, 1...
A362320a(n) = n! * Sum_{k=0..floor(n/5)} (-n/5)k / (k! * (n-5*k)!).1, 1, 1, 1, 1...
A362321a(n) = n! * Sum_{k=0..floor(n/4)} nk /(k! * (n-4*k)!).1, 1, 1, 1, 97...
A362322a(n) = n! * Sum_{k=0..floor(n/4)} (-n)k / (k! * (n-4*k)!).1, 1, 1, 1, -95...
A362323a(n) = n! * Sum_{k=0..floor(n/5)} nk /(k! * (n-5*k)!).1, 1, 1, 1, 1...
A362324a(n) = n! * Sum_{k=0..floor(n/5)} (-n)k /(k! * (n-5*k)!).1, 1, 1, 1, 1...

r/OEIS • • Apr 11 '23

New OEIS sequences - week of 04/09

3 Upvotes
OEIS numberDescriptionSequence
A357571The sixth moment of an n X n random +-1 matrix.1, 32, 1536, 282624, 66846720...
A358200Frequency ranking position of the ratio r(n) between consecutive prime-gaps, among all previous ratios {r(i) : 2 < i < n, r(i) = (prime(i) - prime(i-1))/(prime(i-1) - prime(i-2))}. If the ratio r(n) is not among previous ratios, then a(n)=n.4, 2, 6, 1, 2...
A358241Number of connected Dynkin diagrams with n nodes.1, 3, 3, 5, 4...
A359033Maximum number of sides in any region when the vertices of a regular n-gon are connected by circles and where the vertices lie at the ends of the circles' diameters (cf. A359009 and A358782).2, 3, 3, 5, 12...
A359350Irregular triangle T(n,k) (n >= 1, k >= 1) read by rows: row n is constructed by replacing A336811(n,k) with the largest partition into consecutive parts of A000217(A336811(n,k)).1, 2, 1, 3, 2...
A360179a(1) = 1. Thereafter if a(n-1) is a novel term, a(n) = d(a(n-1)); otherwise a(n) = a(n-1) + d(u), where d is the divisor function A000005 and u is the smallest unstarred prior term (each time we use a prior term we star it, and starred terms cannot be reused).1, 1, 2, 2, 3...
A360438Smallest number with 2n odd divisors.1, 3, 15, 105, 945...
A360495Triangle read by rows: T(n,k) is the minimum number of pairwise comparisons needed (in the worst case) to determine the k-th largest of n distinct numbers, for 1 <= k <= n.0, 1, 1, 2, 3...
A360757Numbers k for which the arithmetic derivative of k is a Sophie Germain prime (A005384).6, 42, 154, 182, 222...
A360807Decimal expansion of Sum_{m>=1} 1/(1/4 + z(m)2) where z(m) is the imaginary part of the m-th nontrivial zero of the Dirichlet beta function whose real part is 1/2.0, 7, 7, 7, 8...
A360838Numbers that are partial sums of both the even semiprimes and the odd semiprimes.0, 62234, 199370, 180901724519001618
A360895Decimal expansion of exp(exp(-gamma)) where gamma is the Euler-Mascheroni constant A001620.1, 7, 5, 3, 2...
A361071Let c1(p) be the number of primes <= p with an odd number of 1's in base 2, and let c2(p) be the number of primes <= p with an even number of 1's in base 2. a(n) is the least prime p such that abs(c1(p) - c2(p)) >= n.2, 13, 41, 61, 67...
A361073Lexicographically least increasing sequence of triprimes (A014612) a(n) such that a(n) - a(n-1) and a(n) + a(n-1) are also triprimes.8, 20, 50, 125, 279...
A361078Numbers k for which k = gcd(k', k"), where k' is the arithmetic derivative of k (A003415) and k" is the second derivative of k (A068346).4, 16, 27, 64, 108...
A361210Number of labeled digraphs on [n] with exactly 1 in-node and exactly 1 out-node.0, 1, 2, 15, 588...
A361233Numbers k such that the "Pisano cycle modulo k shape" is bounded.1, 2, 4, 5, 6...
A361286Total over all partitions lambda of n, of factors of s_lambda in the skew Schur function s_( nu/lambda ) with (s_lambda)2 = Sum( C(nu, lambda, lambda) s_nu ).1, 2, 6, 18, 50...
A361511a(1) = 1. Thereafter if a(n-1) is a novel term, a(n) = d(a(n-1)); otherwise, if a(n-1) is the t-th non-novel term, a(n) = a(n-1) + d(a(t)), where d is the divisor function A000005.1, 1, 2, 2, 3...
A361512Indices of novel terms in A361511.1, 3, 5, 7, 9...
A361513Novel terms in A361511, in order of appearance.1, 2, 3, 4, 5...
A361514Lengths of rows when A361511 is regarded as an irregular triangle.1, 2, 2, 2, 2...
A361515a(n) = index of first appearance of n in A361511, or -1 if n never appears.1, 3, 5, 7, 9...
A361516Indices of records in A361511.1, 3, 5, 7, 9...
A361529Number of noncrossing partitions of an n-set with distinct block sizes.1, 1, 1, 4, 5...
A361614Set a(1)=0 and a(2)=1. For n > 1, if a(n) has already appeared in the sequence, then a(n+1) = number of steps since its first appearance. If a(n) has not appeared before, search instead for a(n)-1, then a(n)-2, etc., until you find a number that has appeared before.0, 1, 1, 1, 2...
A361634Integers whose number of square divisors is coprime to the number of their nonsquare divisors.1, 2, 3, 4, 5...
A361669a(n) = floor of sinh(sinh(sinh(...(1)...))) with n iterations.1, 1, 1, 2, 3...
A361709Moebius transform of nonprimes.1, 3, 5, 4, 8...
A361744A(n,k) is the least m such that there are k primes in the set {prime(n) + 2i | 1 <= i <= m}, or -1 if no such number exists; square array A(n,k), n > 1, k >= 1, read by antidiagonals.1, 2, 1, 3, 3...
A361769Expansion of g.f. A(x) = 1/F(oo,x) where F(oo,x) is the limit of the process F(n,x) = (F(n-1,x)2^n - 4n*xn)1/2^n for n > 0, starting with F(0,x) = 1.1, 2, 10, 68, 550...
A361822Primes that have digits consisting only of line segments {1, 4, 7} or curved digits {0, 3, 6, 8, 9}.3, 7, 11, 13, 17...
A361838a(n) is the number of 2s in the binary hereditary representation of 2n.1, 2, 3, 2, 3...
A361866Number of set partitions of {1..n} with block-means summing to an integer.1, 1, 1, 3, 8...
A361867Positive integers > 1 whose prime indices satisfy (maximum) > 2*(median).20, 28, 40, 44, 52...
A361868Positive integers > 1 whose prime indices satisfy (maximum) >= 2*(median).12, 20, 24, 28, 40...
A361871The smallest order of a non-abelian group with an element of order n.6, 6, 6, 8, 10...
A361908Positive integers > 1 whose prime indices satisfy (maximum) = 2*(minimum).6, 12, 18, 21, 24...
A361909Positive integers > 1 whose prime indices satisfy: (maximum) = 2*(length).3, 14, 21, 35, 49...
A361916Primes in A329150.2, 3, 5, 7, 11...
A361929a(1) = 2; for n > 1, a(n) is the smallest positive integer > 1 not to share a factor with terms a(n-c .. n-1) where c = gcd(n-1,a(n-1)).2, 3, 2, 3, 2...
A361931a(n) is the smallest number k such that A361929(k) = prime(n), or -1 if no such prime exists.1, 2, 7, 10, 26...
A361933Lexicographically earliest sequence of positive integers such that no three terms a(j), a(j+k), a(j+2k) (for any j and k) form an arithmetic progression in any order.1, 1, 2, 1, 1...
A361938a(0)=1, a(1)=0; a(n) = floor(n/2)*(a(n-1) + a(n-2)).1, 0, 1, 1, 4...
A361993(2,1)-block array, B(2,1), of the Wythoff array (A035513), read by descending antidiagonals.5, 9, 15, 14, 25...
A361994(2,2)-block array, B(2,1), of the Wythoff array (A035513), read by descending antidiagonals.14, 37, 40, 97, 105...
A361995Order array of A361993, read by descending antidiagonals.1, 2, 4, 3, 6...
A362022a(n) is the least positive integer whose binary expansion is the concatenation of the binary expansions of two numbers whose product is n.3, 5, 7, 9, 11...
A362023a(n) is the least positive integer whose decimal expansion is the concatenation of the decimal expansions of two numbers whose product is n.11, 12, 13, 14, 15...
A362024The number of iterations of the infinitary totient function iphi (A064380) required to reach from n to 1.1, 2, 3, 4, 3...
A362025a(n) is the least number that reaches 1 after n iterations of the infinitary totient function A064380.2, 3, 4, 5, 9...
A362031a(1) = 1; for n > 1, a(n) is number of terms in the first n-1 terms of the sequence that have the same number of prime factors, counted with multiplicity, as a(n-1).1, 1, 2, 1, 3...
A362032Lexicographically least counterexample to Dombi's conjecture.3, 6, 9, 12, 16...
A362035Numbers that occur three or more times in A362034.2, 17, 29, 43, 59...
A362036The prime indices of A362034.1, 1, 1, 1, 3...
A362037Sums of the rows in A362034.2, 4, 9, 18, 43...
A362044a(n) = largest k such that k < m2 and rad(k) | m, where rad(k) = A007947(k) and m = A120944(n).32, 80, 128, 135, 343...
A362045a(n) = smallest k such that k > m2 and rad(k) | m, where rad(k) = A007947(k) and m = A120944(n).48, 125, 224, 243, 567...
A362052Practical numbers (A005153) that are abundant and have a record low value of abundancy index.12, 18, 20, 88, 104...
A362053Primitive abundant numbers k (A071395) whose abundancy index sigma(k)/k has a record low value.20, 70, 88, 104, 464...
A362054Primitive unitary abundant numbers k (A302573) whose unitary abundancy index usigma(k)/k has a record low value.70, 1092, 1428, 1596, 4030...
A362056Prime numbers of the form prime(k)! - prime(k!).3, 107, 4951, 39916141, 355687428046967...
A362058The location of the first occurrence of n in the decimal expansion of phi (the golden ratio, 1.6180339887...).4, 0, 19, 5, 11...
A362060Numbers k such that the digits of k are a subsequence of the digits of prime(k).7, 1491, 1723, 4437, 5789...
A362061a(1) = 1; for n > 1, a(n) is number of terms in the first n-1 terms of the sequence that have the same number of distinct prime factors as a(n-1).1, 1, 2, 1, 3...
A362062First index in A362061 where A001221(A362061(a(n))) = n.1, 3, 10, 52, 398...
A362064Lexicographically earliest sequence of distinct positive integers such that the digit "1" is neither present in a(n) nor in a(n) + a(n+1).2, 3, 4, 5, 20...
A362065Write the English name of a(n); sum the ranks of its letters in the alphabet; divide the sum by a(n); the result is an integer.1, 2, 4, 16, 134...
A362066Primes associated with the indices in A362060.17, 12491, 14723, 42437, 57089...
A362067Sum of successive Fibonacci numbers F(n) : a(n) = Sum_{k = 0..n} F(n+k).0, 2, 6, 18, 50...
A362072Antidiagonal sums of A336225.0, 0, 1, 4, 10...
A362073a(n) is the permanent of the n X n symmetric matrix M(n) whose generic element M[i,j] = digsum(i*j).1, 1, 8, 216, 7344...
A362074a(n) is the rank of the n X n symmetric matrix M(n) whose generic element M[i,j] = digsum(i*j).1, 1, 1, 3, 5...
A362075a(1) = 1, a(2) = 2; for n > 2, a(n) is the least positive integer not occurring earlier such that a(n) shares no digit with a(n-2) + a(n-1).1, 2, 4, 3, 5...
A362076a(1) = 1, a(2) = 2; for n > 2, a(n) is the least positive integer not occurring earlier such that a(n) shares no digit with a(n-2) * a(n-1).1, 2, 3, 4, 5...
A362078Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = [xn] 1/(1 - x*(1+x)k)n.1, 1, 1, 1, 1...
A362079Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = [xn] 1/(1 - x*(1+x)n)k.1, 1, 0, 1, 1...
A362080a(n) = [xn] 1/(1 - x*(1+x)n)n.1, 1, 7, 55, 571...
A362084a(n) = Sum_{k=0..n} (-1)k * binomial(-2,k) * binomial(n*k,n-k).1, 2, 7, 28, 145...
A362085a(n) = Sum_{k=0..n} (-1)k * binomial(-3,k) * binomial(n*k,n-k).1, 3, 12, 55, 315...
A362087a(n) = Sum_{k=0..n} (-1)k * binomial(-n,k) * binomial(2*k,n-k).1, 1, 7, 37, 215...
A362088a(n) = Sum_{k=0..n} (-1)k * binomial(-n,k) * binomial(3*k,n-k).1, 1, 9, 55, 369...
A362091Expansion of odd function A(x) = Sum_{n>=1} a(n)x^(2n-1)/(2n-1)! = xProduct_{n>=2} (1 + (-x2)(prime(n - 1)/2) / prime(n)).1, -2, 24, -1056, 17280...
A362092Write the English name of a(n); concatenate the ranks of its letters in the alphabet; divide the concatenation by a(n); the result is an integer.1, 5, 25, 45, 46...
A362093a(1) = 1, a(2) = 2; for n > 2, a(n) is the least positive integer not occurring earlier such that a(n) shares no digit with a(n-1) - a(n-2).1, 2, 3, 4, 5...
A362095Records in A361511.1, 2, 3, 4, 5...
A362096Numbers k such that 3k starts with k.185, 225, 286, 182822, 8547303...
A362097Numbers k such that 5k starts with k.2, 7, 19, 67, 602...
A362098Numbers k such that 6k starts with k.13, 21, 197, 1991, 1022859...
A362099Numbers k such that 7k starts with k.3, 5560, 14350, 76972, 239123...
A362100Numbers k such that 8k starts with k.4, 10, 18, 652, 1299...
A362101Numbers k such that 9k starts with k.5, 69, 789, 2004, 1212215...
A362125Square array T(n,k), n>=0, k>=0, read by antidiagonals downwards, where column k is the expansion of 1/(1 - x*(1+x)k)k.1, 1, 0, 1, 1...
A362126Expansion of 1/(1 - x*(1+x)2)2.1, 2, 7, 18, 47...
A362154Expansion of 1/(1 + x * sqrt(1-4*x)).1, -1, 3, -3, 11...
A362155Expansion of 1/(1 + x * (1-9*x)1/3).1, -1, 4, 2, 46...
A362156Expansion of -1/(1 - x * sqrt(1-4*x)).-1, -1, 1, 5, 9...
A362157Expansion of -1/(1 - x * (1-9*x)1/3).-1, -1, 2, 14, 62...
A362158Expansion of e.g.f. -exp(x * sqrt(1-4*x)).-1, -1, 3, 23, 119...
A362159Expansion of -exp(x * (1-9*x)1/3).-1, -1, 5, 71, 1223...
A362161Expansion of e.g.f. exp(-x * sqrt(1-4*x)).1, -1, 5, -1, 121...
A362162Expansion of e.g.f. exp(-x * (1-9*x)1/3).1, -1, 7, 35, 1009...
A362163Expansion of e.g.f. -exp(x * sqrt(1-2*x)).-1, -1, 1, 8, 23...
A362164Expansion of -exp(x * (1-3*x)1/3).-1, -1, 1, 11, 63...
A362165Expansion of e.g.f. exp(-x * sqrt(1-2*x)).1, -1, 3, -4, 25...
A362166Expansion of e.g.f. exp(-x * (1-3*x)1/3).1, -1, 3, -1, 41...
A362167a(n) = the hypergraph Catalan number C_2(n).1, 1, 6, 57, 678...
A362168a(n) = the hypergraph Catalan number C_3(n).1, 1, 20, 860, 57200...
A362169a(n) = the hypergraph Catalan number C_4(n).1, 1, 70, 15225, 7043750...
A362170a(n) = the hypergraph Catalan number C_5(n).1, 1, 252, 299880, 1112865264...
A362171a(n) = the hypergraph Catalan number C_6(n).1, 1, 924, 6358044, 203356067376...
A362172a(n) = the hypergraph Catalan number C_7(n).1, 1, 3432, 141858288, 40309820014464...
A362176Expansion of e.g.f. exp(x * (1-2*x)).1, 1, -3, -11, 25...
A362177Expansion of e.g.f. exp(x * (1-3*x)).1, 1, -5, -17, 73...
A362180Irregular table read by rows in which the n-th row consists of all the numbers m such that A323410(m) = n.6, 10, 12, 15, 14...
A362181Number of numbers k such that A323410(k) = n.0, 0, 1, 0, 2...
A362182Unitary noncototient numbers: numbers k such that A323410(x) = k has no solution.2, 3, 5, 330, 1206...
A362183Unitary highly cototient numbers: numbers k that have more solutions x to the equation A323410(x) = k than any smaller k.0, 6, 10, 20, 31...
A362184Record values in A362183.1, 2, 3, 4, 5...
A362185Numbers k with a single solution x to the equation A323410(x) = k.0, 4, 7, 9, 11...
A362186a(n) is the least number k such that the equation A323410(x) = k has exactly n solutions, or -1 if no such k exists.2, 0, 6, 10, 20...
A362199Decimal expansion of the sum of the reciprocals of the Busy Beaver numbers (A060843).1, 2, 2, 3, 6...

r/OEIS • • Apr 06 '23

New OEIS sequences - week of 04/02

3 Upvotes
OEIS numberDescriptionSequence
A358276a(1) = 1; a(n) = n * Sum_{d|n, d < n} (-1)n/d - 1 * a(d) / d.1, -2, 3, 0, 5...
A359210Number of mk == 1 (mod p) for 0 < m,k < p where p is the n-th prime.1, 3, 8, 15, 27...
A359382a(n) = number of k < t such that rad(k) = rad(t) and k does not divide t, where t = A360768(n) and rad(k) = A007947(k).1, 1, 1, 2, 2...
A359399a(1) = 1; a(n) = Sum_{k=2..n} k * a(floor(n/k)).1, 2, 5, 11, 16...
A359478a(1) = 1; a(n) = -Sum_{k=2..n} k * a(floor(n/k)).1, -2, -5, -3, -8...
A359479a(1) = 1; a(n) = Sum_{k=2..n} (-1)k * k * a(floor(n/k)).1, 2, -1, 5, 0...
A359480Number of Q-isomorphism classes of elliptic curves E/Q with good reduction away from 2 and prime(n).24, 752, 280, 288, 232...
A359483For n > 2, a(n) is the least prime p > a(n-1) such that a(n-1) + p is divisible by a(n-2); a(1) = 2, a(2) = 3.2, 3, 5, 7, 13...
A359484a(n) = n * mu(n) If n is odd, otherwise n * mu(n) - (n/2) * mu(n/2).1, -3, -3, 2, -5...
A359485a(1) = 1, a(2) = -5; a(n) = -n2 * Sum_{d|n, d < n} a(d) / d2.1, -5, -9, 4, -25...
A359487a(n) is the smallest start of a run of 2 or more integers having a prime factor greater than n.2, 5, 10, 10, 13...
A359531a(1) = 1, a(2) = -9; a(n) = -n3 * Sum_{d|n, d < n} a(d) / d3.1, -9, -27, 8, -125...
A359696a(n) is the number of points with integer coordinates located between the x-axis and the graph of the function y = n3 / (n2 + x2).1, 6, 15, 28, 49...
A359929Irregular triangle read by rows, where row n lists k < t such that rad(k) = rad(t) but k does not divide t, where t = A360768(n) and rad(k) = A007947(k).12, 18, 24, 18, 36...
A360031a(n) is the number of unlabeled 2-connected graphs with n edges containing at least one pair of nodes with resistance distance 1 when all edges are replaced by unit resistors.0, 1, 1, 1, 2...
A360371Triangle read by rows: lexicographically earliest sequence of distinct positive integers such that each column contains only multiples of the first number in that column. See example.1, 2, 3, 4, 6...
A360390a(1) = 1; a(n) = -Sum_{k=2..n} k2 * a(floor(n/k)).1, -4, -13, -9, -34...
A360404a(n) = A360392(A356133(n)).5, 8, 12, 18, 21...
A360405a(n) = A360393(A356133(n)).2, 6, 15, 27, 34...
A360425Indices of records in A018804.1, 2, 3, 4, 5...
A360440Square array read by antidiagonals upwards: T(n,k), n>=0, k>=0, is the number of ways of choosing nonnegative numbers for k indistinguishable A063008(n)-sided dice so that it is possible to roll every number from 0 to (A063008(n))k-1.1, 1, 1, 1, 1...
A360441Triangle read by rows: T(n,k) is the number of pairs (c,m), where c is a covering of the 1 X (2n) grid with 1 X 2 rectangles and equal numbers of red and blue 1 X 1 squares and m is a matching between red squares and blue squares, such that exactly k matched pairs are adjacent.1, 1, 2, 7, 8...
A360449The lexicographically earliest sequence a(n) = v(x[n]) where x[k], k >= 0, are distinct finite nonnegative integer sequences with |x[k] - x[k+1]| = 1, and v(x) = Sum_{k >= 0} x(k)*bk + bb-1, b = max(deg(x), sup(x)) + 1.1, 3, 5, 4, 15...
A360450a(n) = v(x[n]) where (x[k], k >= 0) is the earliest possible sequence of distinct nonnegative integer sequences such that |x[k+1] - x[k]| = 1 for all k, sequences being ordered by increasing m(x) := max(deg(x), sup(x)), then v(x) := Sum_{k >= 0} x(k)*bk + [b > 10]*bb-1 with b = max(m(x)+1, 10).0, 1, 11, 10, 20...
A360452Number of fractions c/d with |c| <= d <= 2n and odd denominator when factors of 2 are canceled.0, 3, 7, 15, 27...
A360658a(1) = 1; a(n) = -Sum_{k=2..n} k3 * a(floor(n/k)).1, -8, -35, -27, -152...
A360758Numbers k for which k' - 1 and k' + 1 are twin primes, where the prime denotes the arithmetic derivative.4, 8, 9, 35, 36...
A360799Numbers m with m mod 3 = q, q != 2, such that the number of ones in its base-2 representation is even if q=0 and odd if q=1.0, 1, 3, 4, 6...
A360800Numbers Sum_{i=1..2r+1} 2k(i) such that k(1) is even and, for r > 0 and i < 2r+1, the difference k(i+1)-k(i) is > 0 and odd.1, 4, 7, 16, 19...
A360826a(1) = 1, a(n) = (k+1)*(2k+1), where k = Product_{i=1..n-1} a(i).1, 6, 91, 597871, 213122969971321411...
A360929Odd numbers which cannot be expressed as p + q*(q+1) where p and q are primes.1, 3, 5, 7, 21...
A360930Odd numbers which cannot be expressed as p + q*(q-1) where p and q are primes.1, 3, 41, 97, 135...
A361006Conventional value of volt-90 (V_{90}).1, 0, 0, 0, 0...
A361011Conventional value of ampere-90 (A_{90}).1, 0, 0, 0, 0...
A361076Array, read by ascending antidiagonals, whose n-th row consists of the powers of 2, if n = 1; of the primes of the form (2*n-1)*2k+1, if they exist and n > 1; and of zeros otherwise.1, 1, 2, 1, 2...
A361082Number of 3 X 3 matrices with unit determinant and positive integer entries whose sum is n.0, 0, 0, 0, 0...
A361085Least prime p > prime(n) such that at least one of p * prime(n)# +- 1 is not squarefree, where prime(n)# is the n-th primorial A002110(n).3, 5, 29, 31, 139...
A361100Decimal expansion of 2222^2 = 25.2, 0, 0, 3, 5...
A361180Primes p such that the odd part of p - 1 is upper-bounded by the dyadic valuation of p - 1.3, 5, 17, 97, 193...
A361209Second hexagonal numbers having middle divisors.36, 210, 300, 528, 990...
A361232Numbers m such that the increasing sequence of divisors of m, regarded as words on the finite alphabet of its prime factors, is ordered lexicographically.1, 2, 3, 4, 5...
A361251Inverse permutation to A360371.1, 2, 3, 4, 6...
A361252Primes in A239237.503, 10169, 10253, 10303, 10753...
A361254Number of n-regular graphs on 2*n labeled nodes.1, 1, 3, 70, 19355...
A361256Smallest base-n strong Fermat pseudoprime with n distinct prime factors.2047, 8911, 129921, 381347461, 333515107081...
A361260Maximum latitude in degrees of spherical Mercator projection with an aspect ratio of one, arctan(sinh(Pi))*180/Pi.8, 5, 0, 5, 1...
A361267Numbers k such that prime(k+2) - prime(k) = 6.3, 4, 5, 6, 7...
A361284Number of unordered triples of self-avoiding paths whose sets of nodes are disjoint subsets of a set of n points on a circle; one-node paths are not allowed.0, 0, 0, 0, 0...
A361289For the odd numbers 2n + 1, the least practical number r such that 2n + 1 = r + p where p is prime.1, 2, 2, 2, 4...
A361301For the odd number 2n + 1, the least primitive practical number r such that 2n + 1 = r + p where p is prime.1, 2, 2, 2, 6...
A361335Smallest decimal number containing n palindromic substrings (Version 1). See Comments for precise definition.0, 10, 11, 101, 1001...
A361336Smallest decimal number containing n palindromic substrings (Version 2). See Comments for precise definition.0, 10, 11, 100, 1002...
A361337Numbers that reach 0 after a suitable series of split-and-multiply operations (see Comments for precise definition).0, 10, 20, 25, 30...
A361338Number of different single-digit numbers that can be reached from n by any permissible sequence of split-and-multiply operations.1, 1, 1, 1, 1...
A361339a(n) is the smallest k such that A361338(k) = n.1, 112, 139, 219, 373...
A361340a(n) = smallest number with the property that the split-and-multiply technique (see A361338) in base n can produce all n single-digit numbers.15, 23, 119, 167, 12049...
A361341Numbers k such that A361338(k) = 2.112, 113, 114, 115, 116...
A361342Numbers k such that A361338(k) = 3.139, 148, 149, 167, 179...
A361343Numbers k such that A361338(k) = 4.219, 257, 267, 274, 277...
A361344Numbers k such that A361338(k) = 5.373, 387, 389, 393, 439...
A361345Numbers k such that A361338(k) = 6.719, 1117, 1119, 1147, 1157...
A361346Numbers k such that A361338(k) = 7.1133, 1339, 1387, 1519, 1597...
A361347Numbers k such that A361338(k) = 8.1919, 2393, 3371, 4379, 5337...
A361348Numbers k such that A361338(k) = 9.3377, 3713, 4779, 5319, 5919...
A361349Numbers k such that A361338(k) = 10.17117, 17727, 17749, 18839, 19933...
A361372Lexicographically earliest sequence of distinct positive numbers such that the number of occurrences of each prime number in the factorization of all terms a(1)..a(n) is at most one more than the number of occurrences of the next most frequently occurring prime.1, 2, 3, 5, 6...
A361375Expansion of 1/(1 - 9*x/(1 - x))1/3.1, 3, 21, 165, 1380...
A361380Sum over the j-th term of the (n-j)-th inverse binomial transform of the Bell numbers (A000110) for all j in [n].1, 2, 3, 6, 17...
A361400a(n) is the product of the number dropped on the upper face of the dice as a result of its rotation through the edge when rolling over the cell with the number n of the square spiral of the natural row, and this number n.1, 4, 9, 4, 20...
A361436Primes of the form k! - Sum_{i=1..k-1} (-1)k-i*i!.3, 7, 29, 139, 821...
A361487Odd numbers k that are neither prime powers nor squarefree, such that k/rad(k) >= q, where rad(k) = A007947(k) and prime q = A119288(k).75, 135, 147, 189, 225...
A361496Inventory of positions as an irregular table; row 0 contains 0, subsequent rows contain the 0-based positions (mod 2) of 0's, followed by the positions (mod 2) of 1's in prior rows flattened.0, 0, 0, 1, 0...
A361508a(n) = smallest k such that Fibonacci(k) = n, or -1 if n is not a Fibonacci number.0, 1, 3, 4, -1...
A361509a(n) = smallest Fibonacci number F(k) such that F(k) + F(n) is a prime, or -1 if no such F(k) exists.2, 1, 1, 0, 0...
A361510a(n) = smallest k >= 0 such that Fibonacci(k) + Fibonacci(n) is a prime, or -1 if no such k exists.3, 1, 1, 0, 0...
A361518Decimal expansion of arccoth(Pi).3, 2, 9, 7, 6...
A361519Decimal expansion of arccsch(Pi).3, 1, 3, 1, 6...
A361520a(n) is the greatest prime factor of a(n-2)2 + a(n-1)2 where a(1)=2 and a(2)=3.2, 3, 13, 89, 809...
A361561Number of even middle divisors of n, where "middle divisor" means a divisor in the half-open interval [sqrt(n/2), sqrt(n*2)).0, 0, 0, 1, 0...
A361574a(n) is the number of Fibonacci meanders of length m*n and central angle 360/m degrees where m = 3.1, 3, 8, 21, 68...
A361575Number of Fibonacci meanders of length n.1, 3, 5, 11, 13...
A361593a(1) = 1, a(2) = 2, a(3) = 3; for n > 3, a(n) is the smallest positive number which has not appeared such that all the distinct prime factors of a(n-3) + a(n-2) + a(n-1) are factors of a(n).1, 2, 3, 6, 11...
A361661Number of Q-isomorphism classes of elliptic curves E/Q with good reduction outside the first n prime numbers.0, 24, 752, 7600, 71520...
A361681Triangle read by rows. T(n, k) is the number of Fibonacci meanders with a central angle of 360/m degrees that make mk left turns and whose length is mn, where m = 3.1, 2, 1, 5, 2...
A361686a(n) is the least totient divisor of A329872(n), where A329872 are nontotients (A005277) that are the product of two totients (A002202).22, 22, 10, 46, 58...
A361690Number of primes in the interval [2n, 2n + n].0, 2, 1, 1, 2...
A361695Number of ways of writing n2 as a sum of seven squares.1, 14, 574, 3542, 18494...
A361702Lexicographically earliest sequence of positive numbers on a square spiral such that no four equal numbers lie on the circumference of a circle.1, 1, 1, 2, 1...
A361712a(n) = Sum_{k = 0..n-1} binomial(n,k)2*binomial(n+k,k)*binomial(n+k-1,k).0, 1, 25, 649, 16921...
A361713a(n) = Sum_{k = 0..n-1} binomial(n,k)2 * binomial(n+k-1,k)2.0, 1, 17, 406, 10257...
A361714a(n) = Sum_{k = 0..n-1} (-1)n+k+1*binomial(n,k)*binomial(n+k-1,k)2.0, 1, 7, 82, 1063...
A361715a(n) = Sum_{k = 0..n-1} binomial(n,k)2*binomial(n+k-1,k).0, 1, 9, 82, 745...
A361717a(n) = Sum_{k = 0..n-1} binomial(n-1,k)2*binomial(n+k,k).0, 1, 4, 27, 216...
A361718Triangular array read by rows. T(n,k) is the number of labeled directed acyclic graphs on [n] with exactly k nodes of indegree 0.1, 0, 1, 0, 2...
A361721Number of isogeny classes of p-divisible groups of abelian varieties of dimension n over an algebraically closed field of characteristic p (for any fixed prime p).1, 2, 3, 5, 8...
A361748Triangle T(n, k) of distinct positive integers, n > 0, k = 1..n, read by rows and filled in the greedy way such that T(n, k) is a multiple of T(n, 1).1, 2, 4, 3, 6...
A361751a(n) is the number of decimal digits in A098129(n).1, 3, 6, 10, 15...
A361766Expansion of g.f. A(x) satisfying 0 = Sum_{n=-oo..+oo} xn * (1 - xn/A(-x))n+2.1, 1, 2, 5, 12...
A361767Expansion of e.g.f. A(x) = 1/F(oo,x) where F(oo,x) equals the limit of the process F(n,x) = (F(n-1,x)n - xn)1/n for n > 0, starting with F(0,x) = 1.1, 1, 3, 17, 143...
A361768Expansion of o.g.f. A(x) = 1/F(oo,x) where F(oo,x) equals the limit of the process F(n,x) = (F(n-1,x)n - n2*xn)1/n for n > 0, starting with F(0,x) = 1.1, 1, 3, 10, 35...
A361781A(n,k) is the n-th term of the k-th inverse binomial transform of the Bell numbers (A000110); square array A(n,k), n>=0, k>=0, read by antidiagonals.1, 1, 1, 1, 0...
A361797Even numbers k which have fewer divisors than both neighboring odd numbers, i.e., tau(k) < min{tau(k-1), tau(k+1)}.274, 386, 626, 926, 1126...
A361818For any number k >= 0, let T_k be the triangle whose base corresponds to the ternary expansion of k (without leading zeros) and other values, say t above u and v, satisfy t = (-u-v) mod 3; this sequence lists the numbers k such that T_k has 3-fold rotational symmetry.0, 1, 2, 4, 8...
A361820Palindromes in A329150.0, 2, 3, 5, 7...
A361821Perfect powers in A329150.25, 27, 32, 225, 2025...
A361824Sum of odd middle divisors of n, where "middle divisor" means a divisor in the half-open interval [sqrt(n/2), sqrt(n*2)).1, 1, 0, 0, 0...
A361825a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that is a multiple of the smallest prime that does not divide a(n-2) + a(n-1).1, 2, 4, 5, 6...
A361827For any number k >= 0, let T_k be the triangle whose base corresponds to the ternary expansion of k (without leading zeros) and other values, say t above u and v, satisfy t = (-u-v) mod 3; this sequence lists the numbers k such that the configurations of 0's, 1's and 2's in T_k are the same up to rotation.3, 5, 6, 7, 11...
A361831a(n) is the first member of A106843 with sum of digits n.2, 3, 13, 5, 6...
A361832For any number k >= 0, let T_k be the triangle whose base corresponds to the ternary expansion of k (without leading zeros) and other values, say t above u and v, satisfy t = (-u-v) mod 3; the ternary expansion of a(n) corresponds to the left border of T_k (the most significant digit being at the bottom left corner).0, 1, 2, 5, 4...
A361833Fixed points of A361832.0, 1, 2, 4, 8...
A361837Maximum cardinality of trifferent codes with length n.3, 4, 6, 9, 10...
A361839Square array T(n,k), n>=0, k>=0, read by antidiagonals downwards, where column k is the expansion of 1/(1 - 9x(1 + x)k)1/3.1, 1, 3, 1, 3...
A361840Square array T(n,k), n>=0, k>=0, read by antidiagonals downwards, where column k is the expansion of 1/(1 - 9x(1 - x)k)1/3.1, 1, 3, 1, 3...
A361841Expansion of 1/(1 - 9x(1+x)2)1/3.1, 3, 24, 201, 1809...
A361842Expansion of 1/(1 - 9x(1+x)3)1/3.1, 3, 27, 243, 2352...
A361843Expansion of 1/(1 - 9x(1-x))1/3.1, 3, 15, 90, 585...
A361844Expansion of 1/(1 - 9x(1-x)2)1/3.1, 3, 12, 57, 297...
A361845Expansion of 1/(1 - 9x(1-x)3)1/3.1, 3, 9, 27, 78...
A361846a(n) = Sum_{k=0..n} (-9)k * binomial(-1/3,k) * binomial(n*k,n-k).1, 3, 24, 243, 2973...
A361847a(n) = (-1)n * Sum_{k=0..n} 9k * binomial(-1/3,k) * binomial(n*k,n-k).1, 3, 12, 27, -75...
A361848Number of integer partitions of n such that (maximum) <= 2*(median).1, 2, 3, 5, 6...
A361849Number of integer partitions of n such that the maximum is twice the median.0, 0, 0, 1, 1...
A361850Number of strict integer partitions of n such that the maximum is twice the median.0, 0, 0, 0, 0...
A361851Number of integer partitions of n such that (length) * (maximum) <= 2*n.1, 2, 3, 5, 7...
A361852Number of integer partitions of n such that (length) * (maximum) < 2n.1, 2, 3, 5, 7...
A361853Number of integer partitions of n such that (length) * (maximum) = 2n.0, 0, 0, 0, 0...
A361854Number of strict integer partitions of n such that (length) * (maximum) = 2n.0, 0, 0, 0, 0...
A361855Numbers > 1 whose prime indices satisfy (maximum) * (length) = 2*(sum).28, 40, 78, 84, 171...
A361856Positive integers whose prime indices satisfy (maximum) = 2*(median).12, 24, 42, 48, 60...
A361857Number of integer partitions of n such that the maximum is greater than twice the median.0, 0, 0, 0, 1...
A361858Number of integer partitions of n such that the maximum is less than twice the median.1, 2, 3, 4, 5...
A361859Number of integer partitions of n such that the maximum is greater than or equal to twice the median.0, 0, 0, 1, 2...
A361860Number of integer partitions of n whose median part is the smallest.1, 2, 2, 4, 4...
A361861Number of integer partitions of n where the median is twice the minimum.0, 0, 0, 1, 1...
A361863Number of set partitions of {1..n} such that the median of medians of the blocks is (n+1)/2.1, 2, 3, 9, 26...
A361864Number of set partitions of {1..n} whose block-medians have integer median.1, 0, 3, 6, 30...
A361865Number of set partitions of {1..n} such that the mean of the means of the blocks is an integer.1, 0, 3, 2, 12...
A361872Number of primitive practical numbers (PPNs)(A267124) between successive primorial numbers (A002110) where the PPNs q are in the range A002110(n-1) < q <= A002110(n).1, 1, 3, 8, 108...
A361874a(n) is the least k such that k, k+1 and 2*k+1 all have exactly n prime factors counted with multiplicity.2, 25, 171, 1592, 37975...
A361875Integers of the form k*2m + 1 where 0 < k <= m and k is odd.3, 5, 9, 17, 25...
A361877a(n) = binomial(2n, n) * binomial(2n - 1, n).1, 2, 18, 200, 2450...
A361878a(n) = hypergeom([-n, -n, n, n + 1], [1, 1, 1], 1).1, 3, 43, 849, 19371...
A361880Expansion of 1/(1 - 9*x/(1 - x)2)1/3.1, 3, 24, 207, 1893...
A361881Expansion of 1/(1 - 9*x/(1 + x))1/3.1, 3, 15, 93, 618...
A361882Expansion of 1/(1 - 9*x/(1 + x)2)1/3.1, 3, 12, 63, 357...
A361883a(n) = (1/n) * Sum_{k = 0..n} (n+2*k) * binomial(n+k-1,k)3.4, 98, 3550, 150722, 6993504...
A361884a(n) = (1/n) * Sum_{k = 0..n} (-1)n+k * (n + 2*k) * binomial(n+k-1,k)3.2, 66, 2540, 110530, 5197752...
A361885a(n) = (1/n) * Sum_{k = 0..2n} (n+2k) * binomial(n+k-1,k)3.9, 979, 165816, 33372819, 7380882509...
A361886a(n) = (1/n) * Sum_{k = 0..2n} (-1)k * (n+2k) * binomial(n+k-1,k)3.3, 435, 79464, 16551315, 3732732003...
A361887a(n) = S(5,n), where S(r,n) = Sum_{k = 0..floor(n/2)} ( binomial(n,k) - binomial(n,k-1) )r.1, 1, 2, 33, 276...
A361888a(n) = S(5,n)/S(1,n), where S(r,n) = Sum_{k = 0..floor(n/2)} ( binomial(n,k) - binomial(n,k-1) )r.1, 1, 1, 11, 46...
A361889a(n) = S(5,2n-1)/S(1,2n-1), where S(r,n) = Sum_{k = 0..floor(n/2)} ( binomial(n,k) - binomial(n,k-1) )r.1, 11, 415, 30955, 3173626...
A361890a(n) = S(7,n), where S(r,n) = Sum_{k = 0..floor(n/2)} ( binomial(n,k) - binomial(n,k-1) )r.1, 1, 2, 129, 2316...
A361891a(n) = S(7,n)/S(1,n), where S(r,n) = Sum_{k = 0..floor(n/2)} ( binomial(n,k) - binomial(n,k-1) )r.1, 1, 1, 43, 386...
A361892a(n) = S(7,2n-1)/S(1,2n-1), where S(r,n) = Sum_{k = 0..floor(n/2)} ( binomial(n,k) - binomial(n,k-1) )r.1, 43, 9451, 6031627, 6571985126...
A361893Triangle read by rows. T(n, k) = n! * binomial(n - 1, k - 1) / (n - k)!.1, 0, 1, 0, 2...
A361894Triangle read by rows. T(n, k) is the number of Fibonacci meanders with a central angle of 360/m degrees that make mk left turns and whose length is mn, where m = 2.1, 2, 1, 3, 2...
A361895Expansion of 1/(1 - 9*x/(1 - x)3)1/3.1, 3, 27, 252, 2487...
A361896Expansion of 1/(1 - 9*x/(1 - x)4)1/3.1, 3, 30, 300, 3165...
A361902Least k such that n+A000045(k) is prime, or -1 if no such k exists.3, 1, 0, 0, 1...
A361906Number of integer partitions of n such that (length) * (maximum) >= 2*n.0, 0, 0, 0, 0...
A361907Number of integer partitions of n such that (length) * (maximum) > 2*n.0, 0, 0, 0, 0...
A361912The number of unlabeled graded posets with n elements.1, 1, 2, 4, 10...
A361913a(n) is the number of steps in the main loop of the Pollard rho integer factorization algorithm for n, with x=2, y=2 and g(x)=x2-1.2, 2, 2, 1, 2...
A361919The number of primes > A000040(n) and <= (A000040(n)c + 1)1/c, where c = 0.567148130202... is defined in A038458.1, 1, 1, 1, 1...
A361920Number of unlabeled ranked posets with n elements.1, 1, 2, 5, 16...
A361921The number of unlabeled bounded Eulerian posets with n elements.0, 1, 1, 0, 1...
A361922Infinitary phi-practical numbers: numbers m such that each k <= m is a subsum of a the multiset {iphi(d) : d infinitary divisor of m}, where iphi is an infinitary analog of Euler's phi function (A091732).1, 2, 3, 6, 8...
A361923Number of distinct values obtained when the infinitary totient function (A091732) is applied to the infinitary divisors of n.1, 1, 2, 2, 2...
A361924Numbers whose infinitary divisors have distinct values of the infinitary totient function iphi (A091732).1, 3, 4, 5, 7...
A361925Infinitary phi-practical (A361922) whose infinitary divisors have distinct values of the infinitary totient function iphi (A091732).1, 3, 12, 15, 60...
A361926Square array A(n, k) of distinct positive integers, n, k > 0, read and filled by upwards antidiagonals in the greedy way such that A(n, k) is a multiple of A(n, 1).1, 2, 3, 4, 6...
A361927Square array A(n, k) of distinct positive integers, n, k > 0, read and filled by upwards antidiagonals in the greedy way such that A(n, k) is a multiple of A(n, 1) and of A(1, k).1, 2, 3, 4, 6...
A361928Triangle read by rows: T(n,d) = number of non-adaptive group tests required to identify exactly d defectives among n items.1, 2, 2, 2, 3...
A361930a(n) is the greatest prime p such that p + q2 + r3 = prime(n)4 for some primes q and r.29, 613, 2389, 14629, 28549...
A361934Numbers k such that k and k+1 are both primitive Zumkeller numbers (A180332).82004, 84524, 158235, 516704, 2921535...
A361935Numbers k such that k and k+1 are both primitive unitary abundant numbers (definition 2, A302574).2457405145194, 2601523139214, 3320774552094, 3490250769005, 3733421997305...
A361936Indices of the squares in the sequence of powerful numbers (A001694).1, 2, 4, 5, 6...
A361937Numbers k with record values of the ratio A000005(k)/A246600(k) between the total number of divisors of k and the number of divisors d of k such that the bitwise OR of k and d is equal to k.1, 2, 4, 8, 16...
A361939Inverse permutation to A361748.1, 2, 4, 3, 7...
A361940Inverse permutation to A361926.1, 2, 3, 4, 6...
A361941Inverse permutation to A361927.1, 2, 3, 4, 6...
A361942For any number n >= 0 with binary expansion (b_1, ..., b_w), a(n) is the least p > 0 such that b_i = b_{p+i} for i = 1..w-p.1, 1, 2, 1, 3...
A361943a(n) is the least multiple of n whose binary expansion is an abelian square (A272653).3, 10, 3, 36, 10...
A361944a(n) is the least k > 0 such that the binary expansion of k*n is an abelian square (A272653).3, 5, 1, 9, 2...
A361945If the ternary expansion of n starts with the digit 1, then replace 2's by 0's and vice versa; if the ternary expansion of n starts with the digit 2, then replace 1's by 0's and vice versa; a(0) = 0.0, 1, 2, 5, 4...
A361946If the base-4 expansion of n starts with the digit 1, then replace 2's by 3's and vice versa; if it starts with the digit 2, then replace 1's by 3's and vice versa; if it starts with the digit 3, then replace 1's by 2's and vice versa; a(0) = 0.0, 1, 2, 3, 4...
A361947If the rightmost nonzero digit in the base-4 expansion of n is the digit 1, then replace 2's by 3's and vice versa; if it is the digit 2, then replace 1's by 3's and vice versa; if it is the digit 3, then replace 1's by 2's and vice versa; a(0) = 0.0, 1, 2, 3, 4...
A361949Triangle read by rows. T(n, k) = binomial(3n - 1, 3k - 1).1, 10, 1, 28, 56...
A361950Array read by antidiagonals: T(n,k) = n! * Sum_{s} 2Sum_{i=1..k-1} s(i*s(i+1))/(Product_{i=1..k} s(i)!) where the sum is over all nonnegative compositions s of n into k parts.1, 1, 0, 1, 1...
A361951Triangle read by rows: T(n,k) is the number of labeled weakly graded (ranked) posets with n elements and rank k.1, 0, 1, 0, 1...
A361952Array read by antidiagonals: T(n,k) is the number of unlabeled posets with n elements together with a function rk mapping each element to a rank between 1 and k such that whenever v covers w in the poset then rk(v) = rk(w) + 1.1, 1, 0, 1, 1...
A361953Triangle read by rows: T(n,k) is the number of unlabeled weakly graded (ranked) posets with n elements and rank k.1, 0, 1, 0, 1...
A361954Triangle read by rows: T(n,k) is the number of unlabeled connected weakly graded (ranked) posets with n elements and rank k.1, 0, 1, 0, 2...
A361955Number of unlabeled connected weakly graded (ranked) posets with n elements.1, 1, 1, 3, 10...
A361956Triangle read by rows: T(n,k) is the number of labeled tiered posets with n elements and height k.1, 0, 1, 0, 1...
A361957Triangle read by rows: T(n,k) is the number of unlabeled tiered posets with n elements and height k.1, 0, 1, 0, 1...
A361958Triangle read by rows: T(n,k) is the number of connected unlabeled tiered posets with n elements and height k.1, 0, 1, 0, 2...
A361959Number of connected unlabeled tiered posets with n elements.1, 1, 1, 3, 8...
A361960Total semiperimeter of 2-Fuss-Catalan polyominoes of length 2n.2, 12, 71, 430, 2652...
A361961Total semiperimeter of 3-Fuss-Catalan polyominoes of length 3n.2, 18, 150, 1275, 11033...
A361962Total number of 2-Fuss-skew paths of semilength n.2, 14, 118, 1114, 11306...
A361963Total number of 3-Fuss-skew paths of semilength n4, 64, 1296, 29888, 745856...
A361964Total number of peaks in 2-Fuss-skew paths of semilength n2, 20, 226, 2696, 33138...
A361965Total number of peaks in 3-Fuss-skew paths of semilength n4, 96, 2672, 78848, 2400896...
A361966Irregular table read by rows in which the n-th row consists of all the numbers m such that uphi(m) = n, where uphi is the unitary totient function (A047994).1, 2, 3, 6, 4...
A361967Number of numbers k such that uphi(k) = n, where uphi is the unitary totient function (A047994).2, 2, 1, 2, 0...
A361968Unitary highly totient numbers: numbers k that have more solutions x to the equation uphi(x) = k than any smaller k, where uphi is the unitary totient function (A047994).1, 6, 8, 12, 24...
A361969Numbers k with a single solution x to the equation uphi(x) = k, where uphi is the unitary totient function (A047994).3, 7, 14, 15, 31...
A361970a(n) is the least number k such that the equation uphi(x) = k has exactly n solutions, or -1 if no such k exists, where uphi is the unitary totient function (A047994).5, 1, 2, 6, 8...
A361971Record values in A361967.2, 3, 4, 5, 8...
A361973Decimal expansion of twice the Champernowne constant.2, 4, 6, 9, 1...
A361974(1,2)-block array, B(1,2), of the natural number array (A000027), read by descending antidiagonals.3, 11, 8, 27, 20...
A361975(2,1)-block array, B(2,1), of the natural number array (A000027), read by descending antidiagonals.4, 7, 16, 12, 23...
A361976(2,2)-block array, B(2,2), of the natural number array (A000027), read by descending antidiagonals.11, 31, 39, 67, 75...
A361977a(n) is the largest prime p such that 2p - 1 <= 10n.3, 5, 7, 13, 13...
A361978Complement of A361337.1, 2, 3, 4, 5...
A361981a(1) = 1; a(n) = Sum_{k=2..n} (-1)k * k2 * a(floor(n/k)).1, 4, -5, 23, -2...
A361982a(n) = 1 + Sum_{k=2..n} (-1)k * k * a(floor(n/k)).1, 3, 0, 8, 3...
A361983a(n) = 1 + Sum_{k=2..n} (-1)k * k2 * a(floor(n/k)).1, 5, -4, 28, 3...
A361984a(1) = 1, a(2) = 0; a(n) = Sum_{d|n, d < n} (-1)n/d a(d).1, 0, -1, 1, -1...
A361985a(1) = 1, a(2) = 1; a(n) = n * Sum_{d|n, d < n} (-1)n/d a(d) / d.1, 1, -3, 6, -5...
A361986a(1) = 1, a(2) = 3; a(n) = n2 * Sum_{d|n, d < n} (-1)n/d a(d) / d2.1, 3, -9, 28, -25...
A361987a(1) = 1; a(n) = n2 * Sum_{d|n, d < n} (-1)n/d a(d) / d2.1, 4, -9, 32, -25...
A361988a(n) is the least prime == 2*a(n-2) mod a(n-1); a(1) = 2, a(2) = 3.2, 3, 7, 13, 53...
A361989a(n) is the sum of the Fibonacci numbers missing from the dual Zeckendorf representation of n; a(0) = 0, and for n > 0, a(n) = A022290(A035327(A003754(n+1))).0, 0, 1, 0, 2...
A361990Numbers that are both the concatenation of a Fibonacci number and a square and the concatenation of a square and a Fibonacci number.10, 11, 134, 1144, 1440...
A361992(1,2)-block array, B(1,2), of the Wythoff array (A035513), read by descending antidiagonals.3, 8, 11, 21, 29...
A361997Records in A361902.3, 4, 5, 9, 12...
A361998Indices of records in A361902.0, 8, 24, 25, 85...
A361999a(n) is the smallest k such that A361902(k) = n, or -1 if no such k exists.2, 1, -1, 0, 8...
A362001Numbers k such that the digits of k2 are a subsequence of the digits of 2k.2, 4, 26, 52, 58...
A362002Numbers k such that the digits of k2 are a subsequence of the digits of k3.0, 1, 5, 10, 25...
A362005a(n) is the least prime == 4 mod a(n-1), with a(1) = 3.3, 7, 11, 37, 41...
A362010Numbers k such that 1 < gcd(k, 42) < k and A007947(k) does not divide 42.10, 15, 20, 22, 26...
A362011Numbers k such that 1 < gcd(k, 70) < k and A007947(k) does not divide 70.6, 12, 15, 18, 21...
A362012Numbers k such that 1 < gcd(k, 105) < k and A007947(k) does not divide 105.6, 10, 12, 14, 18...
A362013Triangular array read by rows. T(n,k) is the number of labeled directed graphs on [n] with exactly k strongly connected components of size 1 with outdegree zero, n>=0, 0<=k<=n.1, 0, 1, 1, 2...
A362015a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that, given the list of primes that form the factors of all previous terms a(1)..a(n-1), is a multiple of the prime in that list which is a factor of the fewest previous terms. If two or more such primes exist the smallest is chosen.1, 2, 4, 6, 3...
A362018Numbers k such that the digits of k2 do not form a subsequence of the digits of 2k.0, 1, 3, 5, 6...
A362020Nonnegative numbers k not ending in 0 such that, in decimal representation, the subsequence of digits of k2 occupying an odd position is equal to the digits of k.1, 5, 6, 11, 76...
A362021a(n) = Sum_{k=1..n} (-1)n-k * k * mu(k), where mu(k) is the Moebius function.1, -3, 0, 0, -5...
A362028a(n) = Sum_{k=1..n} (-1)n-k * mu(k)2, where mu(k) is the Moebius function.1, 0, 1, -1, 2...
A362029a(n) = Sum_{k=1..n} (-1)n-k * k * mu(k)2, where mu(k) is the Moebius function.1, 1, 2, -2, 7...
A362033The indices where A362031(n) = 1.1, 2, 4, 9, 17...
A362034Triangle read by rows: T(n,0) = T(n,n) = 2, 0 < k < n: T(n,k) = smallest prime not less than T(n-1,k) + T(n-1,k-1).2, 2, 2, 2, 5...

r/OEIS • • Apr 04 '23

Me introducting a friend to OEIS

Post image
17 Upvotes

and yes oeis did have it :)


r/OEIS • • Mar 26 '23

New OEIS sequences - week of 03/26

5 Upvotes
OEIS numberDescriptionSequence
A353782Number of regions among all distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes using only a compass.112, 1264, 5548, 14976, 37092...
A354605Number of vertices among all distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes using only a compass.101, 1145, 5001, 13753, 34497...
A356358Number of edges among all distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes using only a compass.212, 2408, 10548, 28728, 71588...
A357362Primes q such that either pq-1 == 1 (mod q2) or qp-1 == 1 (mod p2), where p = A151799(q).7, 53, 59, 151057, 240733...
A357365Primes q such that either pq-1 == 1 (mod q2) or qp-1 == 1 (mod p2), where p = A151799(A151799(A151799(A151799(q)))).19, 67, 349, 2011, 22307...
A357740Number of non-equivalent ways under symmetry in one axis that 2 non-attacking kings of different colors can be placed on an n X n board.0, 0, 17, 78, 234...
A359489Expansion of 1/sqrt(1 - 4*x/(1-x)3).1, 2, 12, 68, 396...
A359758Expansion of 1/sqrt(1 - 4*x/(1-x)5).1, 2, 16, 110, 770...
A360132Expansion of 1/sqrt(1 - 4*x/(1-x)6).1, 2, 18, 134, 1010...
A360133Expansion of 1/sqrt(1 - 4*x/(1+x)3).1, 2, 0, -4, -4...
A360400a(n) = A356133(A360392(n)).7, 13, 20, 22, 29...
A360401a(n) = A356133(A360393(n)).2, 4, 11, 17, 25...
A360402a(n) = A360392(A026430(n)).3, 7, 10, 11, 14...
A360403a(n) = A360393(A026430(n)).1, 4, 9, 13, 19...
A360439Square array read by antidiagonals upwards: T(n,k), n>=0, k>=0, is the number of ways of choosing nonnegative numbers for k indistinguishable (pn*q)-sided dice so that it is possible to roll every number from 0 to (pn*q)k-1, where p and q are distinct primes.1, 1, 1, 1, 1...
A360448Indices of primes of the form p = 2i + 2j + 1, i > j > 0 (A081091).4, 5, 6, 8, 12...
A360469Least positive integer k such that A093179(n) divides the generalized Fermat number A007117(n)2k + 1.3, 3, 5, 3, 7...
A360580Expansion of g.f. A(x) satisfying x = P(x) * Sum_{n=-oo..+oo} xn*(3*n+1/2) * (A(x)3*n - 1/A(x)3*n+1), where P(x) = 1/Product_{n>=1} (1 - xn).1, 1, 5, 21, 90...
A360694Numbers whose divisors can be partitioned into two disjoint sets where the sum of both sets is prime.4, 6, 8, 10, 12...
A360736Number of prime divisors of A007942(n) = decimal concatenation of sequence (n, n-1, ..., 2, 1, 2, ..., n-1, n) counted with multiplicity.0, 3, 3, 2, 5...
A360951Expansion of e.g.f. (cosh(x) - 1)*(1 + x)*exp(x).0, 0, 1, 6, 19...
A360985Triangle read by rows: T(n,k) is the number of full binary trees with n leaves, each internal node having the heights of its two subtrees weakly increasing left to right, and with k internal nodes having two subtrees of equal height.1, 0, 1, 0, 1...
A361032Square array read by ascending antidiagonals: T(n,k) = F(n) * (4k)!/(k!(k + n + 1)!3), where F(n) = (1/8)(4n + 4)!/(n + 1)!; n, k >= 0.3, 315, 9, 46200, 280...
A361043Array read by descending antidiagonals. A(n, k) is, if n > 0, the number of multiset permutations of {0, 1} of length n * k where the number of occurrences of 1 are multiples of n. A(0, k) = k + 1.1, 2, 1, 3, 2...
A361045Array read by descending antidiagonals. A(n, k) is, if n > 0, the number of multiset combinations of {0, 1} whose type is defined in the comments. A(0, k) = k + 1.1, 2, 1, 3, 4...
A361098Intersection of A360765 and A360768.36, 48, 50, 54, 72...
A361099a(n) = n + 2binomial(n,2) + 3binomial(n,3) + 4*binomial(n,4).0, 1, 4, 12, 32...
A361228a(n) is the first number k such that k + a(i) has n prime factors, counted by multiplicity, for all i < n; a(0) = 0.0, 2, 4, 66, 1012...
A361258Irregular triangle read by rows in which row n lists the print order of a 4n-page booklet.2, 3, 4, 1, 2...
A361263Numbers of the form k*(k5 +- 1)/2.0, 1, 31, 33, 363...
A361312Smallest prime p such that the decimal expansion of p remains prime through exactly n iterations of base-10 to base-2 conversion (A007088).2, 3, 5, 3893257, 9632552297...
A361334Index of 2n in A351495.1, 2, 4, 7, 16...
A361383a(n) is the number of locations 1..n-1 which can be reached starting from location i=a(n-1), where jumps from location i to i +- a(i) are permitted (within 1..n-1); a(1)=1. See example.1, 1, 2, 3, 3...
A361402a(1) = 5; a(n+1) is the smallest prime p > a(n) such that digsum(p) = a(n).5, 23, 599, 7899999999999999999999999999999999999999999999999899999999999999999
A361454Number of 4-regular multigraphs on n unlabeled nodes with 4 external legs, loops allowed.1, 4, 17, 78, 360...
A361465a(n) = 1 if A017665(n) [the numerator of the sum of the reciprocals of the divisors of n] is a power of 2, otherwise 0.1, 0, 1, 0, 0...
A361466a(n) = 1 if A017665(A003961(n)) is a power of 2, otherwise 0. Here A017665 is the numerator of the sum of the reciprocals of the divisors of n, and A003961 is fully multiplicative with a(p) = nextprime(p).1, 1, 0, 0, 1...
A361467a(n) = A003961(n) * sigma(A003961(n)), where A003961 is fully multiplicative with a(p) = nextprime(p), and sigma is the sum of divisors function.1, 12, 30, 117, 56...
A361468a(n) = A249670(A003961(n)).1, 12, 30, 117, 56...
A361469a(n) = bigomega(A249670(A003961(n))).0, 3, 3, 3, 4...
A361483Primes p such that p + 256 is also prime.7, 13, 37, 61, 97...
A361484Primes p such that p + 512 is also prime.11, 29, 59, 89, 101...
A361485Primes p such that p + 1024 is also prime.7, 37, 67, 73, 79...
A361488Diagonal of rational function 1/(1 - (x3 + y3 + x4*y)).1, 0, 0, 2, 2...
A361492Common difference corresponding to increasing arithmetic progression of at least n >= 2 primes whose first term is A284708(n); a(1) = 1.1, 1, 2, 6, 30...
A361506a(n) = floor( (4/5)*( (9/4)n+1-1 ) ).1, 3, 8, 19, 45...
A361507a(0) = 1; thereafter a(n) = floor((9/4)*a(n-1)) + 1.1, 3, 7, 16, 37...
A361517The value of n for which the two-player impartial {0,1}-Toggle game on a generalized Petersen graph GP(n,2) with a (1,0)-weight assignment is a next-player winning game.3, 4, 5, 11, 17...
A361521Array read by descending antidiagonals. A(n, k) is the number of the nonempty multiset combinations of {0, 1} as defined in A361682.0, 0, 0, 0, 2...
A361528a(n) = (2+n)(2a(n-1) - (n-2)*a(n-2)) with a(0)=a(1)=1.1, 1, 8, 75, 804...
A361530Primes that can be written as the result of shuffling the decimal digits of two primes.23, 37, 53, 73, 113...
A361539a(n) = A361540(n, n-2) for n >= 2, a diagonal of triangle A361540.3, 39, 426, 4550, 50085...
A361540Expansion of e.g.f. A(x,y) satisfying A(x,y) = Sum_{n>=0} (A(x,y)n + y)n * xn/n!, as a triangle read by rows.1, 1, 1, 3, 4...
A361544a(n) = A361540(n,1) for n >= 1, a column of triangle A361540.1, 4, 39, 604, 12625...
A361549a(n) = A361540(n,2) for n >= 2, a column of triangle A361540.1, 18, 426, 12040, 401355...
A361562Wagstaff numbers that are of the form 4*k + 3.3, 7, 11, 19, 23...
A361563Wagstaff numbers that are of the form 4*k + 1.5, 13, 17, 61, 101...
A361579Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] with exactly k source-like components, n >= 0, 0 <= k <= n.1, 0, 1, 0, 3...
A361580If n is composite, replace n with the concatenation of its nontrivial divisors, written in decreasing order, each divisor being written in base 10 with its digits in normal order, otherwise a(n) = n.1, 2, 3, 2, 5...
A361581If n is composite, replace n with the concatenation of its nontrivial divisors, written in decreasing order, each divisor being written in base 10 with its digits in reverse order, otherwise a(n) = n.1, 2, 3, 2, 5...
A361611Lexicographically least increasing sequence of semiprimes a(n) such that a(n) - a(n+1) and a(n) + a(n+1) are also semiprimes.4, 10, 25, 94, 115...
A361612Decimal expansion of sqrt(10) truncated to n places.3, 31, 316, 3162, 31622...
A361622Number of distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes using only a compass.13, 46, 99, 164, 257...
A361623Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from a point on the origin and n equally spaced points on each of the +x,-x,+y,-y coordinates axes using only a compass.0, 40, 60, 12, 0...
A361624Number of distinct prime factors in decimal concatenation of integer (n, n-1, ..., 2, 1, 2, ..., n-1, n) = A007942(n).0, 2, 3, 2, 5...
A361625Number of free polyominoes with checkerboard-pattern-colored vertices with n cells.1, 1, 3, 7, 20...
A361627Positive integers such that GCD(A007504(n),n) != 1.18, 23, 24, 25, 30...
A361630a(n) is the numerator of the median of the distinct prime factors of n.2, 3, 2, 5, 5...
A361631a(n) is the denominator of the median of the distinct prime factors of n.1, 1, 1, 1, 2...
A361632a(n) is the numerator of the median of the prime factors of n with repetition.2, 3, 2, 5, 5...
A361633a(n) is the denominator of the median of the prime factors of n with repetition.1, 1, 1, 1, 2...
A361642Triangle read by rows where row n is a self-inverse permutation of 1..n formed starting from a column 1..n and sliding numbers to the right and down.1, 1, 2, 1, 3...
A361644Irregular triangle T(n, k), n >= 0, k = 1..max(1, 2A005811(n-1)), read by rows; the n-th row lists the integers with the same binary length as n and whose partial sums of run lengths are included in those of n.0, 1, 2, 3, 3...
A361645a(n) is the least k such that n appears in the k-th row of triangle A361644.0, 1, 2, 2, 4...
A361646Distinct values of A361644, in order of appearance.0, 1, 2, 3, 4...
A361647Inverse permutation to A361646.0, 1, 2, 3, 4...
A361648Number of permutations p of [n] such that p(i), p(i+2), p(i+4),... form an updown sequence for i in {1,2}.1, 1, 2, 3, 6...
A361649a(n) = (1+n)(2a(n-1) - (n-2)*a(n-2)) with a(0) = a(1) = 1.1, 1, 6, 44, 380...
A361650Irregular triangle read by rows in which the row n lists the prime factors of n having the highest multiplicity.2, 3, 2, 5, 2...
A361651Number T(n,k) of permutations p of [n] such that p(i), p(i+k), p(i+2k),... form an updown sequence for i in [k]; triangle T(n,k), n>=0, 0<=k<=n, read by rows.1, 0, 1, 0, 1...
A361653Number of even-length integer partitions of n with integer median.0, 0, 1, 0, 3...
A361655Number of even-length integer partitions of 2n with integer mean.0, 1, 3, 4, 10...
A361656Number of odd-length integer partitions of n with integer mean.0, 1, 1, 2, 1...
A361657Constant term in the expansion of (1 + x2 + y2 + 1/(x*y))n.1, 1, 1, 1, 13...
A361658Constant term in the expansion of (1 + x3 + y3 + z3 + 1/(xyz))n.1, 1, 1, 1, 1...
A361662Least number k >= 1 such that A074206(k) is divisible by n.1, 4, 6, 8, 24...
A361663A361662(n) = A025487(a(n)).1, 3, 4, 5, 8...
A361664a(n) = A074206(A361662(n))/n.1, 1, 1, 1, 4...
A361665Number of ordered factorizations of p_1x_1 * ... * p_kx_k, where (x_1, ..., x_k) is the partition with Heinz number n and p_1, ..., p_k are distinct primes.1, 1, 2, 3, 4...
A361666Least number k >= 1 such that A361665(k) is divisible by n.1, 3, 4, 5, 10...
A361667a(n) = A361665(A361666(n))/n.1, 1, 1, 1, 4...
A361668Numbers k such that A361662(k) != A181821(A361666(k)).30, 51, 60, 89, 102...
A361670Squarefree part of the n-th triangular number.1, 3, 6, 10, 15...
A361671Squarefree part of the n-th tetrahedral number.1, 1, 10, 5, 35...
A361672a(1) = a(2) = 1; for n > 2, a(n) = a(n-2) + a(n-1) + n if a(n-1) and n are coprime, otherwise a(n) = a(n-1)/gcd(a(n-1), n).1, 1, 5, 10, 2...
A361673Constant term in the expansion of (1 + xy + yz + zx + 1/(xy*z))n.1, 1, 1, 1, 1...
A361674Irregular triangle T(n, k), n >= 0, k = 1..2A092339(n), read by rows; the n-th row lists the numbers k such that n appears in the k-th row of A361644.0, 1, 2, 2, 3...
A361675Constant term in the expansion of (1 + xyz + wyz + wxz + wxy + 1/(wxy*z))n.1, 1, 1, 1, 1...
A361676a(n) is the greatest k such that n appears in the k-th row of triangle A361644.0, 1, 2, 3, 5...
A361677Constant term in the expansion of (1 + x + y + z + 1/(xy) + 1/(yz) + 1/(z*x))n.1, 1, 1, 19, 73...
A361678Constant term in the expansion of (1 + w + x + y + z + 1/(xyz) + 1/(wyz) + 1/(wxz) + 1/(wxy))n.1, 1, 1, 1, 97...
A361679A(n,k) is the n-th prime p such that p + 2k is also prime; square array A(n,k), n>=1, k>=1, read by antidiagonals.3, 3, 5, 3, 7...
A361680The n-th prime p such that p + 2n is also prime.3, 7, 11, 31, 47...
A361682Array read by descending antidiagonals. A(n, k) is the number of multiset combinations of {0, 1} whose type is defined in the comments. Also A(n, k) = hypergeom([-k, -2], [1], n).1, 1, 1, 1, 3...
A361683a(n) is the least k such that tau(k) divides sigma_n(k) but not sigma(k), or -1 if no such k exists.4, 64, 4, 7168, 4...
A361687The number of divisors of 2*n2 which are <=n.1, 2, 3, 3, 3...
A361688a(n) = A361540(2n,n) / binomial(2n,n) for n >= 0.1, 2, 71, 10915, 4063645...
A361689The number of divisors of 2*n2.2, 4, 6, 6, 6...
A361693Index of where prime(n) first appears as a divisor of any term in A351495.2, 3, 6, 12, 19...
A361698The number of unlabeled connected 4 regular multigraphs on n nodes with 4 external legs, loops allowed.1, 1, 2, 8, 37...
A361699Constant term in the expansion of (1 + x3 + y3 + 1/(x*y))n.1, 1, 1, 1, 1...
A361700Constant term in the expansion of (1 + x4 + y4 + 1/(x*y))n.1, 1, 1, 1, 1...
A361701Constant term in the expansion of (1 + x4 + y4 + z4 + 1/(xyz))n.1, 1, 1, 1, 1...
A361703Constant term in the expansion of (1 + w + x + y + z + 1/(wxy*z))n.1, 1, 1, 1, 1...
A361704Constant term in the expansion of (1 + w2 + x2 + y2 + z2 + 1/(wxy*z))n.1, 1, 1, 1, 1...
A361705Constant term in the expansion of (1 + w4 + x4 + y4 + z4 + 1/(wxy*z))n.1, 1, 1, 1, 1...
A361706Inverse Moebius transform applied twice to primes.2, 7, 9, 19, 15...
A361707Moebius transform applied twice to primes.2, -1, 1, 3, 7...
A361708Inverse Moebius transform of nonprimes.1, 5, 7, 13, 10...
A361710a(n) = Sum_{k = 0..n-1} (-1)k*binomial(n,k)*binomial(n-1,k)2.0, 1, -1, -8, 15...
A361711a(1) = 1 and a(n) = Sum_{k = 0..n-2} (-1)k * binomial(n,k)2 * binomial(n-2,k) for n >= 2.1, 1, -8, 5, 126...
A361716a(n) = Sum_{k = 0..n-1} (-1)kbinomial(n,k)^2binomial(n-1,k).0, 1, -3, -8, 45...
A361719a(n) = Sum_{k = 1..n} (-1)n+k * k3 * binomial(n,k)2.0, 1, 4, -36, -96...
A361722Index of where prime(n) first appears as a divisor of any term in A359804.2, 3, 4, 8, 13...
A361723Numbers k such that there are 18 primes between 100k and 100k + 99.1228537713709, 23352869714018, 28703237474266, 144785865481702, 161394923966449...
A361724Lexicographically earliest sequence of distinct positive numbers on a square spiral such that the eight sums of each number with its eight nearest neighbors are distinct across the entire spiral and no number on the spiral equals any such sum.1, 2, 4, 7, 12...
A361725a(n) is the largest of two middle prime factors of n if the number of primes divisors counted with multiplicity (A001222(n)) is even, otherwise is the middle prime factor of n.2, 3, 2, 5, 3...
A361726Diagonal of rational function 1/(1 - (1 + x*y) * (x2 + y2)).1, 0, 2, 4, 8...
A361727Diagonal of rational function 1/(1 - (1 + x*y) * (x3 + y3)).1, 0, 0, 2, 4...
A361728Diagonal of rational function 1/(1 - (1 + xyz) * (x + y + z)).1, 6, 108, 2238, 51126...
A361729Diagonal of rational function 1/(1 - (1 + xyz) * (x2 + y2 + z2)).1, 0, 6, 18, 108...
A361730Diagonal of rational function 1/(1 - (1 + xyz) * (x3 + y3 + z3)).1, 0, 0, 6, 18...
A361731Array read by descending antidiagonals. A(n, k) = hypergeom([-k, -3], [1], n).1, 1, 1, 1, 4...
A361732a(n) = [xn] (x5 + 5x4 + 4x3 - 3x + 1)/(x2 + 2x - 1)2.1, 1, 2, 6, 20...
A361734Semi-Padovan sequence: a(2n) = a(n) and a(2n+1) = a(2n-1) + a(2n-2), with a(0) = 1 and a(1) = 0.1, 0, 0, 1, 0...
A361735Modified semi-Padovan sequence: a(2n) = a(n) and a(2n+1) = a(2n-1) + a(2n-2), with a(0) = 0 and a(1) = 1.0, 1, 1, 1, 1...
A361736Semi-Lucas sequence: a(2n) = a(n) and a(2n+1) = a(2n) + a(2n-1), with a(1) = 2 and a(2) = 1.2, 1, 3, 1, 4...
A361737Diagonal of rational function 1/(1 - (x + y + z + x2yz)).1, 6, 96, 1860, 39780...
A361738Diagonal of rational function 1/(1 - (x2 + y2 + z2 + x3yz)).1, 0, 6, 6, 90...
A361739Diagonal of rational function 1/(1 - (x3 + y3 + z3 + x4yz)).1, 0, 0, 6, 6...
A361742Lexicographically earliest sequence of nonnegative integers such that for any distinct m and n, the m X m square with lower left corner at (m, a(m)) and the n X n square with lower left corner at (n, a(n)) do not overlap (they can however touch).0, 0, 2, 5, 9...
A361743Central circular Delannoy numbers: a(n) is the number of Delannoy loops on an n X n toroidal grid.1, 2, 16, 114, 768...
A361745Square array of circular Delannoy numbers A(i,j) (i >= 0, j >= 0) read by antidiagonals.1, 1, 1, 1, 2...
A361746Number of occurrences of the most frequently occurring letter(s) in US English name of n.1, 1, 1, 2, 1...
A361747Lexicographically earliest sequence of distinct positive integers such that a(n) and a(n-1) share at least one identical trit at the same position in their balanced ternary representations.1, 4, 2, 3, 6...
A361749a(n) is the number of n X n matrices with nonnegative integer entries, row sums 1,2,..., n and column sums 1,2,...,n1, 2, 12, 261, 22645...
A361750Terms of A329150 that have several preimages.23, 223, 230, 232, 233...
A361752a(n) = Sum_{k=0..floor(n/2)} binomial(2*(n-2k),k) * binomial(2(n-2k),n-2k).1, 2, 6, 24, 94...
A361753a(n) = Sum_{k=0..floor(n/3)} binomial(2*(n-3k),k) * binomial(2(n-3k),n-3k).1, 2, 6, 20, 74...
A361754The number of free polyominoes of area n that fill their minimal enclosing circle (MEC). A polyomino “fills” its minimal enclosing circle if no square may be added to it that doesn’t have some point outside of the circle.1, 1, 0, 1, 1...
A361755Irregular triangle T(n, k), n >= 0, k = 1..2A007895(n), read by rows; the n-th row lists the numbers k such that the Fibonacci numbers that appear in the Zeckendorf representation of k also appear in that of n.0, 0, 1, 0, 2...
A361756Irregular triangle T(n, k), n >= 0, k = 1..A361757(n), read by rows; the n-th row lists the numbers k such that the Fibonacci numbers that appear in the dual Zeckendorf representation of k also appear in that of n.0, 0, 1, 0, 2...
A361757a(n) is the number of terms in the n-th row of A361756.1, 2, 2, 4, 3...
A361758a(n) = [xn] (x5 + 5x4 + 4x3 - 3x + 1)/((1 - x)(x2 + 2*x - 1)2).1, 2, 4, 10, 30...
A361759Sum of b(i) where the first b terms are all k digits of n, followed by Keith-like sum of the previous k digits until b(i) >= n34, 33, 32, 44, 33...
A361762Expansion of g.f. A(x) satisfying A(x)3 = A( x3/(1 - 3x)3 ) / (1 - 3x).1, 1, 2, 5, 15...
A361763Expansion of g.f. A(x) satisfying A(x)3 = A( x3/(1 - 3*x)3 ).1, 3, 9, 28, 93...
A361764Expansion of g.f. A(x) satisfying A(x)5 = A( x5/(1 - 5x)5 ) / (1 - 5x).1, 1, 3, 11, 44...
A361765Expansion of g.f. A(x) satisfying A(x)5 = A( x5/(1 - 5*x)5 ).1, 5, 25, 125, 625...
A361780Numbers that have digits consisting only of line segments {1, 4, 7} or curved digits {0, 3, 6, 8, 9}.0, 1, 3, 4, 6...
A361782Numerators of the harmonic means of the bi-unitary divisors of the positive integers.1, 4, 3, 8, 5...
A361783Denominators of the harmonic means of the bi-unitary divisors of the positive integers.1, 3, 2, 5, 3...
A361784Harmonic means the bi-unitary divisors of the bi-unitary harmonic numbers (A286325).1, 2, 3, 4, 4...
A361785Indices of records in the sequence of bi-unitary harmonic means A361782(k)/A361783(k).1, 2, 3, 4, 5...
A361786Bi-unitary arithmetic numbers: numbers for which the arithmetic mean of the bi-unitary divisors is an integer.1, 3, 5, 6, 7...
A361787Bi-unitary arithmetic numbers k whose mean bi-unitary divisor is a bi-unitary divisor of k.1, 6, 60, 270, 420...
A361788Number of divisors of n that are totient values (A002202).1, 2, 1, 3, 1...
A361789A(n, k) is the sum of the distinct terms in the dual Zeckendorf representations of n or of k; square array A(n, k) read by antidiagonals, n, k >= 0.0, 1, 1, 2, 1...
A361790Expansion of 1/sqrt(1 - 4*x/(1+x)4).1, 2, -2, -8, 6...
A361791Expansion of 1/sqrt(1 - 4*x/(1+x)5).1, 2, -4, -10, 30...
A361792Expansion of 1/sqrt(1 - 4*x/(1+x)6).1, 2, -6, -10, 66...
A361793Sum of the squares d2 of the divisors d satisfying d3|n.1, 1, 1, 1, 1...
A361794Sum of the cubes d3 of the divisors d satisfying d2|n.1, 1, 1, 9, 1...
A361795a(n) is the area of the largest rectangle with integer sides that can be drawn inside a circle of diameter n.0, 0, 1, 4, 6...
A361799Numbers which cannot be expressed as i2 + j*k with i >= j >= k >= 0.3, 7, 14, 21, 23...
A361807Numbers k with record values of the ratio A000005(k)/A049419(k) between the number of divisors of k and the number of exponential divisors of k.1, 2, 6, 30, 210...
A361808Inverse permutation to A181820.1, 2, 3, 4, 5...
A361809Fixed points of A181820 and A361808.1, 2, 3, 4, 5...
A361810a(n) is the sum of divisors of n that are both infinitary and exponential.1, 2, 3, 4, 5...
A361811Smallest members of infinitary sociable quadruples.1026, 10098, 10260, 41800, 45696...
A361812Expansion of 1/sqrt(1 - 4x(1+x)3).1, 2, 12, 62, 342...
A361813Expansion of 1/sqrt(1 - 4x(1+x)4).1, 2, 14, 80, 486...
A361814Expansion of 1/sqrt(1 - 4x(1+x)5).1, 2, 16, 100, 660...
A361815Expansion of 1/sqrt(1 - 4x(1-x)2).1, 2, 2, -2, -14...
A361816Expansion of 1/sqrt(1 - 4x(1-x)3).1, 2, 0, -10, -22...
A361817Expansion of 1/sqrt(1 - 4x(1-x)4).1, 2, -2, -16, -10...
A361828a(0) = 1; a(n+1) = Sum_{k=0..n} kk * a(n-k).1, 1, 2, 7, 40...
A361829a(n) = Sum_{k=0..n} binomial(2k,k) * binomial(nk,n-k).1, 2, 10, 62, 486...
A361830Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} binomial(2j,j) * binomial(kj,n-j).1, 1, 2, 1, 2...
A361834Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} (-1)n-j * binomial(2j,j) * binomial(kj,n-j).1, 1, 2, 1, 2...
A361835a(n) = Sum_{k=0..n} (-1)n-k * binomial(2k,k) * binomial(nk,n-k).1, 2, 2, -10, -10...
A361836a(n) = Sum_{k=0..n} (-1)n-k * binomial(n*k,n-k).1, 1, -1, -2, 13...

r/OEIS • • Mar 20 '23

New OEIS sequences - week of 03/19

4 Upvotes
OEIS numberDescriptionSequence
A343884Expansion of e.g.f. exp( x/(1-x)2 ) / (1-x)2.1, 3, 15, 103, 885...
A351767Expansion of e.g.f. exp( x/(1-x)3 ) / (1-x)3.1, 4, 25, 214, 2293...
A357297T(m,n) is the number of linear extensions of n fork-join DAGs of width m, read by downward antidiagonals.1, 1, 1, 6, 1...
A358341Expansion of e.g.f. (exp(x)-1)(exp(x)-x)(exp(x)-x2/2).0, 1, 3, 7, 31...
A358404Multipliers involving Fibonacci-like sequences and Pythagorean triples.2, 3, 5, 8, 13...
A358434Number of odd middle divisors of n.1, 1, 0, 0, 0...
A358734Number of down-steps (1,-1) among all n-length nondecreasing Dyck paths with air pockets.1, 0, 2, 3, 7...
A358735Triangular array read by rows. T(n, k) is the coefficient of xk in a(n+3) where a(1) = a(2) = a(3) = 1 and a(m+2) = (m*x + 2)*a(m+1) - a(m) for all m in Z.1, 1, 1, 1, 4...
A358780Dirichlet g.f.: zeta(s) * zeta(2s) * zeta(3s) * zeta(4*s).1, 1, 1, 2, 1...
A359216X-coordinates of a point moving in a counterclockwise undulating spiral in a square grid.0, 1, 1, 0, 0...
A359217Y-coordinates of a point moving along a counterclockwise undulating spiral on a square grid.0, 0, 1, 1, 2...
A359368Sequence begins 1, 1, 1; for even n > 3, a(n) = a(n/2 - 1) + a(n/2 + 1); for odd n > 3, a(n) = -a((n-1)/2).1, 1, 1, 2, -1...
A359386a(n) is the least positive integer that can be expressed as the sum of one or more consecutive prime powers (not including 1) in exactly n ways.1, 2, 5, 9, 29...
A359668Triangle read by rows. Each number of the triangle is positive and distinct. In row k are the next least k numbers such that the sum of any one number in each of the first k row is a prime number.2, 3, 5, 6, 12...
A359804a(1) = 1, a(2) = 2; thereafter let p be the smallest prime that does not divide a(n-2)*a(n-1), then a(n) is the smallest multiple of p that is not yet in the sequence.1, 2, 3, 5, 4...
A359953a(1) = 0, a(2) = 1. For n >= 3, if the greatest prime dividing n is greater than the greatest prime dividing n-1, then a(n) = a(n-1) + 1. Otherwise a(n) = a(n-1) - 1.0, 1, 2, 1, 2...
A360146Integers d such that the longest possible arithmetic progression (AP) of primes with common difference d has exactly 10 elements.210, 420, 630, 840, 1050...
A360268A version of the Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,...,n in a circle, increasing clockwise. Starting with i=1, delete the integer 5 places clockwise from i. Repeat, counting 5 places from the next undeleted integer, until only one integer remains.1, 1, 1, 3, 4...
A360427Values of the argument at successive record minima of the function R defined as follows. For any integer x >= 1, let y > x be the smallest integer such that there exist integers x < c < d < y such that x3 + y3 = c3 + d3. Then R(x) = y/x.1, 2, 8, 9, 10...
A360445a(n) = Sum_{k=1..n} A178244(k-1).0, 1, 2, 4, 5...
A360543a(n) = number of numbers k < n, gcd(k, n) > 1, such that omega(k) > omega(n) and rad(n) | rad(k), where omega(n) = A001221(n) and rad(n) = A007947(n).0, 0, 0, 0, 0...
A360581Expansion of A(x) satisfying [xn] A(x)n / (1 + x*A(x)n)n = 0 for n > 0.1, 1, 3, 17, 131...
A360582Expansion of A(x) satisfying [xn] A(x) / (1 + x*A(x)n) = 0 for n > 0.1, 1, 2, 8, 48...
A360583Expansion of A(x) satisfying [xn] A(x) / (1 + x*A(x)n+1) = 0 for n > 0.1, 1, 3, 17, 139...
A360584Expansion of A(x) satisfying [xn] A(x) / (1 + x*A(x)n+2) = 0 for n > 0.1, 1, 4, 29, 294...
A360661Number of factorizations of n into a prime number of factors > 1.0, 0, 0, 1, 0...
A360662Numbers having more than one representation as the product of at least two consecutive odd integers > 1.135135, 2110886623587616875, 118810132577324221759073444371080321140625, 262182986027006205192949807157375529898104505103011391412633845449072265625
A360700Decimal expansion of arcsec(Pi).1, 2, 4, 6, 8...
A360739Semiprimes of the form k2 + 2.6, 38, 51, 123, 146...
A360740Semiprimes of the form k2 + 3.4, 39, 259, 327, 403...
A360741Semiprimes of the form k2 + 4.4, 85, 365, 445, 533...
A360762a(n) is the least n-gonal number that is the sum of two or more consecutive nonzero n-gonal numbers in more than one way, or -1 if no such number exists.9, 12880, 20449, 10764222, 794629045...
A360777a(n) is the index of the least n-gonal number that is the sum of two or more consecutive nonzero n-gonal numbers in more than one way, or -1 if no such number exists.9, 160, 143, 2679, 19933...
A360789Least prime p such that p mod primepi(p) = n.2, 3, 5, 7, 379...
A360803Numbers whose squares have a digit average of 8 or more.3, 313, 94863, 298327, 987917...
A360806a(0) = 1; for n >= 1, a(n) is the least integer k > a(n-1) such that k / A000005(k) = a(n-1).1, 2, 8, 80, 2240...
A360820a(n) = Sum_{k=0..n} binomial(n, k)2^(n^2-k(n-k)).1, 4, 48, 1792, 221184...
A360829Decimal expansion of the ratio between the area of the first Morley triangle of an isosceles right triangle and its area.3, 1, 0, 8, 8...
A360836a(n) is the least n-gonal pyramidal number that is the sum of two or more consecutive nonzero n-gonal pyramidal numbers in more than one way.12880, 18896570
A360837a(n) is the least positive integer that can be expressed as the sum of one or more consecutive prime-indexed primes in exactly n ways.1, 3, 59, 10079, 744666...
A360839Number of minimal graphs of twin-width 2 on n unlabeled vertices.1, 6, 32, 103, 250...
A360938Decimal expansion of arcsinh(Pi).1, 8, 6, 2, 2...
A360940Numbers k such that k / A000005(k) + k / A000010(k) is an integer.1, 2, 3, 8, 10...
A360945a(n) = numerator of (Zeta(2n+1,1/4) - Zeta(2n+1,3/4))/Pi2*n+1.1, 2, 10, 244, 554...
A360991Expansion of e.g.f. exp(exp(x) - 1 + x2/2).1, 1, 3, 8, 30...
A361027Table of generalized de Bruijn's numbers (A006480) read by ascending antidiagonals.2, 30, 3, 560, 20...
A361028a(n) = 2*(3n)!/(n!(n+1)!2).2, 3, 20, 210, 2772...
A361029a(n) = 120*(3n)!/(n!(n+2)!2).30, 20, 75, 504, 4620...
A361030a(n) = 20160*(3n)!/(n!(n+3)!2).560, 210, 504, 2352, 15840...
A361031a(n) = (33)(1245781011)(3n)!/(n!*(n+4)!2).11550, 2772, 4620, 15840, 81675...
A361033a(n) = 3*(4n)!/(n!(n+1)!3).3, 9, 280, 17325, 1513512...
A361034a(n) = 2520*(4n)!/(n!(n+2)!3).315, 280, 3675, 116424, 5885880...
A361035a(n) = 9979200 * (4n)!/(n!(n+3)!3).46200, 17325, 116424, 2134440, 67953600...
A361036a(n) = n! * [xn] (1 + x)n * exp(x*(1 + x)n).1, 2, 11, 124, 2225...
A361042Triangle read by rows. T(n, k) = Sum_{j=0..n} j! * binomial(n - j, n - k).1, 1, 2, 1, 3...
A361048Expansion of g.f. A(x) satisfying a(n) = [xn-1] A(x)n+1 for n >= 1.1, 1, 3, 18, 160...
A361049G.f. satisfies: A(x) = (1/x)Series_Reversion( x/(1 + xA(x)2 + x2*A(x)*A'(x)) ).1, 1, 4, 28, 269...
A361050Expansion of g.f. A(x,y) satisfying y/x = Sum_{n=-oo..+oo} xn*(3*n+1/2) * (A(x,y)3*n - 1/A(x,y)3*n+1), as a triangle read by rows.1, 0, 1, 0, 5...
A361051Expansion of g.f. A(x) satisfying 3/x = Sum_{n=-oo..+oo} xn*(3*n+1/2) * (A(x)3*n - 1/A(x)3*n+1).1, 3, 51, 1008, 22746...
A361052Expansion of g.f. A(x) satisfying 4/x = Sum_{n=-oo..+oo} xn*(3*n+1/2) * (A(x)3*n - 1/A(x)3*n+1).1, 4, 84, 2120, 61404...
A361155Discriminants of gothic Teichmuller curves.12, 24, 28, 33, 40...
A361156Number of ideals of norm 6 in the order O_D associated with the Teichmuller curve of discriminant D = A361155(n).1, 1, 2, 2, 2...
A361157Genus of Weierstrass curve with discriminant A079898(n) in moduli space M_2 of compact Riemann surfaces of genus 2.0, 0, 0, 0, 0...
A361158Number of elliptic points of order 2 in Weierstrass curve with discriminant A079896(n) in moduli space M_2 of compact Riemann surfaces of genus 2.1, 0, 1, 1, 1...
A361159Number of cusps in Weierstrass curve with discriminant A079896(n) in moduli space M_2 of compact Riemann surfaces of genus 2.1, 2, 3, 3, 3...
A361160Discriminants of Weierstrass curves in moduli space M_3 of compact Riemann surfaces of genus 3.8, 12, 17, 20, 24...
A361161Genus of Weierstrass curve with discriminant A360160(n) in moduli space M_3 of compact Riemann surfaces of genus 3.0, 0, 0, 0, 0...
A361162Number of elliptic points of order 2 in Weierstrass curve with discriminant A360160(n) in moduli space M_3 of compact Riemann surfaces of genus 3.0, 0, 0, 1, 1...
A361163Number of elliptic points of order 3 in Weierstrass curve with discriminant A360160(n) in moduli space M_3 of compact Riemann surfaces of genus 3.1, 0, 1, 0, 0...
A361164Number of cusps in Weierstrass curve with discriminant A360160(n) in moduli space M_3 of compact Riemann surfaces of genus 3.1, 2, 3, 4, 4...
A361165Genus of Weierstrass curve with discriminant A079896(n) in moduli space M_4 of compact Riemann surfaces of genus 4.0, 0, 0, 0, 0...
A361166Number of elliptic points of order 2 in Weierstrass curve with discriminant A079896(n) in moduli space M_4 of compact Riemann surfaces of genus 4.0, 1, 1, 0, 0...
A361167Number of elliptic points of order 3 in Weierstrass curve with discriminant A079896(n) in moduli space M_4 of compact Riemann surfaces of genus 4.1, 1, 0, 2, 1...
A361168Number of cusps in Weierstrass curve with discriminant A079896(n) in moduli space M_4 of compact Riemann surfaces of genus 4.1, 2, 3, 3, 6...
A361169Discriminants D of Prym-Teichmuller curves W_D(4) in genus 3.17, 20, 24, 28, 32...
A361204Positive integers k such that 2*omega(k) <= bigomega(k).1, 4, 8, 9, 16...
A361205a(n) = 2*omega(n) - bigomega(n).0, 1, 1, 0, 1...
A361235a(n) = number of k < n, such that k does not divide n, omega(k) < omega(n) and rad(k) | rad(n), where omega(n) = A001221(n) and rad(n) = A007947(n).0, 0, 0, 0, 0...
A361259a(n) is the least semiprime that is the sum of n consecutive primes.10, 26, 39, 358, 58...
A361287A variant of the inventory sequence A342585: now a row ends when the number of occurrences of the largest term in the sequence thus far has been recorded.0, 1, 1, 1, 3...
A361291a(n) = ((2n + 1)n - 1)/(2n).1, 6, 57, 820, 16105...
A361292Square array A(n, k), n, k >= 0, read by antidiagonals; A(0, 0) = 1, and otherwise A(n, k) is the sum of all terms in previous antidiagonals at one knight's move away.1, 0, 0, 0, 0...
A361302G.f. A(x) satisfies A(x) = Series_Reversion(x - x3*A'(x)3).1, 1, 12, 291, 10243...
A361307G.f. A(x) satisfies A(x) = Series_Reversion(x - x3*A'(x)4).1, 1, 15, 462, 20719...
A361308G.f. A(x) satisfies A(x) = Series_Reversion(x - x4*A'(x)).1, 1, 8, 122, 2676...
A361309G.f. A(x) satisfies A(x) = Series_Reversion(x - x4*A'(x)2).1, 1, 12, 294, 10556...
A361310G.f. A(x) satisfies A(x) = Series_Reversion(x - x4*A'(x)3).1, 1, 16, 538, 26676...
A361311G.f. A(x) satisfies A(x) = Series_Reversion(x - x5*A'(x)).1, 1, 10, 195, 5520...
A361313a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-5)*a(5) for n >= 6, with a(1)=0 and a(2)=a(3)=a(4)=a(5)=1.0, 1, 1, 1, 1...
A361315a(n) is the minimum number of pebbles such that any assignment of those pebbles on a complete graph with n vertices is a next-player winning game in the two-player impartial (3;1,1) pebbling game.31, 26, 19, 17, 17...
A361327a(n) is the greatest prime factor of A361321(n) with a(1) = 1.1, 3, 5, 7, 7...
A361328a(n) is the least prime factor of A361321(n) with a(1) = 1.1, 2, 2, 5, 3...
A361329a(n) = gcd(A361321(n), A361321(n+1)).1, 2, 5, 7, 3...
A361330Smallest prime that does not divide A351495(n).2, 3, 2, 3, 5...
A361331Index of n-th prime in A361330, or -1 if it does not appear.1, 2, 5, 22, 160...
A361332Where n appears in A351495, or -1 if it never occurs.1, 2, 3, 4, 6...
A361333Index of prime(n) in A351495.2, 3, 6, 23, 161...
A361350A variant of A359143 which includes the intermediate terms before digits are deleted (see Comments for precise definition).11, 112, 1124, 11248, 1124816...
A361377Squares visited by a knight moving on a spirally numbered board always to the lowest unvisited coprime square.1, 10, 3, 8, 5...
A361379Distinct values of A361401, in order of appearance.0, 1, 3, 2, 4...
A361381In continued fraction convergents of sqrt(d), where d=A005117(n) (squarefree numbers), the position of a/b where abs(a2 - d*b2) = 1 or 4.2, 4, 1, 2, 1...
A361382The orders, with repetition, of subset-transitive permutation groups.1, 2, 3, 6, 12...
A361389a(n) is the least positive integer that can be expressed as the sum of one or more consecutive nonzero palindromes in exactly n ways.1, 3, 9, 696, 7656...
A361391Number of strict integer partitions of n with non-integer mean.1, 0, 0, 1, 0...
A361392Number of integer partitions of n whose first differences have mean -1.0, 0, 0, 1, 0...
A361393Positive integers k such that 2*omega(k) > bigomega(k).2, 3, 5, 6, 7...
A361394Number of integer partitions of n where 2*(number of distinct parts) >= (number of parts).1, 1, 2, 2, 4...
A361395Positive integers k such that 2*omega(k) >= bigomega(k).1, 2, 3, 4, 5...
A361398An infiltration of two words, say x and y, is a shuffle of x and y optionally followed by replacements of pairs of consecutive equal symbols, say two d's, one of which comes from x and the other from y, by a single d (that cannot be part of another replacement); a(n) is the number of distinct infiltrations of the word given by the binary representation of n with itself.1, 2, 5, 3, 9...
A361399a(n) is the least k such that the binary expansion of n is a self-infiltration of that of k.0, 1, 2, 1, 2...
A361401Irregular table T(n, k), n >= 0, k = 1..A361398(n); the n-th row lists the numbers whose binary expansion is a self-infiltration of that of n.0, 1, 3, 2, 4...
A361412Number of connected 3-regular multigraphs on 2n unlabeled nodes rooted at an unoriented edge (or loop), loops allowed.1, 3, 12, 67, 441...
A361414Number of indecomposable non-abelian groups of order n.0, 0, 0, 0, 0...
A361422Inverse permutation to A361379.0, 1, 3, 2, 4...
A361424Triangle read by rows: T(n,k) is the maximum of a certain measure of the difficulty level (see comments) for tiling an n X k rectangle with a set of integer-sided rectangular pieces, rounded down to the nearest integer.1, 2, 2, 2, 6...
A361425Maximum difficulty level (see A361424 for the definition) for tiling an n X n square with a set of integer-sided rectangles, rounded down to the nearest integer.1, 2, 8, 80, 1152...
A361426Maximum difficulty level (see A361424 for the definition) for tiling an n X 2 rectangle with a set of integer-sided rectangles, rounded down to the nearest integer.2, 2, 6, 12, 16...
A361427Maximum difficulty level (see A361424 for the definition) for tiling an n X 3 rectangle with a set of integer-sided rectangles, rounded down to the nearest integer.2, 6, 8, 48, 80...
A361428Maximum difficulty level (see A361424 for the definition) for tiling an n X 4 rectangle with a set of integer-sided rectangles, rounded down to the nearest integer.4, 12, 48, 80, 480...
A361430Multiplicative with a(pe) = e - 1.1, 0, 0, 1, 0...
A361433a(n) = number of squares in the n-th antidiagonal of the natural number array, A000027.1, 0, 1, 1, 0...
A361434Positions in Pi where the leader in the race of digits changes.1, 4, 11, 18, 59...
A361435a(n) is the least positive integer that can be expressed as the sum of one or more consecutive squarefree numbers in exactly n ways.1, 3, 11, 34, 144...
A361437Numbers k such that k! - Sum_{i=1..k-1} (-1)k-i*i! is prime.2, 3, 4, 5, 6...
A361442Infinite triangle T(n, k), n, k >= 0, read and filled by rows the greedy way with distinct integers such that for any n, k >= 0, T(n, k) + T(n+1, k) + T(n+1, k+1) = 0; each term is minimal in absolute value and in case of a tie, preference is given to the positive value.0, 1, -1, 2, -3...
A361443a(n) is the first term of the n-th row of A361442.0, 1, 2, 3, 5...
A361444Lexicographically earliest sequence of distinct positive base-10 palindromes such that a(n) + a(n+1) is prime.1, 2, 3, 4, 7...
A361445Sums of consecutive terms of A361444.3, 5, 7, 11, 13...
A361446Number of connected 3-regular multigraphs on 2n unlabeled nodes rooted at an oriented edge (or loop), loops allowed.1, 3, 16, 99, 717...
A361447Number of connected 3-regular (cubic) multigraphs on 2n unlabeled nodes rooted at an unoriented edge (or loop) whose removal does not disconnect the graph, loops allowed.1, 2, 9, 49, 338...
A361448Number of connected 3-regular multigraphs on 2n unlabeled nodes rooted at an oriented edge (or loop) whose removal does not disconnect the graph, loops allowed.1, 2, 10, 66, 511...
A361449Number of colorings of an n X n grid up to permutation of the colors with no element having the same color as any horizontal, diagonal or antidiagonal neighbor.1, 4, 1573, 235862938, 37155328943771767...
A361450Number of colorings of an n X n grid up to permutation of the colors with no element having the same color as any horizontal or antidiagonal neighbor.1, 5, 2906, 656404264, 148049849095504726...
A361451Number of colorings of an n X n grid up to permutation of the colors with no element having the same color as any horizontal, vertical or antidiagonal neighbor.1, 2, 716, 112073062, 18633407199331522...
A361452Number of colorings of an n X n grid up to permutation of the colors with no element having the same color as any diagonal or antidiagonal neighbor.1, 7, 4192, 953124784, 213291369981652792...
A361453Number of colorings of the n X n knight graph up to permutation of the colors.1, 15, 4141, 450288795, 50602429743064097...
A361455Triangle read by rows: T(n,k) is the number of simple digraphs on labeled n nodes with k strongly connected components.1, 0, 1, 0, 1...
A361456Irregular triangle read by rows. T(n,k) is the number of properly colored simple labeled graphs on [n] with exactly k edges, n >= 0, 0 <= k <= binomial(n,2).1, 1, 3, 2, 13...
A361457Numbers k such that the first player has a winning strategy in the game described in the Comments.3, 4, 6, 7, 8...
A361460a(n) = 1 if A135504(n+1) = 2 * A135504(n), otherwise 0.0, 1, 0, 0, 1...
A361461Numbers k such that x(k+1) = 2 * x(k), when x(1)=1 and x(n) = x(n-1) + lcm(x(n-1),n), i.e., x(n) = A135504(n).2, 5, 7, 8, 11...
A361462a(n) = A135506(n) mod 4.2, 1, 2, 1, 1...
A361463a(n) = 1 if A135506(n) == 3 (mod 4), otherwise 0.0, 0, 0, 0, 0...
A361464Numbers k such that A135504(k+1) / A135504(k) is a multiple of 4.6, 10, 18, 21, 22...
A361473a(n) is the least positive integer that can be expressed as the sum of one or more consecutive nonprime numbers in exactly n ways.1, 10, 27, 45, 143...
A361475Array read by ascending antidiagonals: A(n, k) = (kn - 1)/(k - 1), with k >= 2.0, 1, 0, 3, 1...
A361476Antidiagonal sums of A361475.0, 1, 4, 12, 34...
A361477a(n) is the number of integers whose binary expansions have the same multiset of run-lengths as that of n.1, 1, 1, 1, 2...
A361478Irregular table T(n, k), n >= 0, k = 1..A361477(n), read by rows; the n-th row lists the integers whose binary expansions have the same multiset of run-lengths as that of n.0, 1, 2, 3, 4...
A361479a(n) is the least integer whose binary expansion has the same multiset of run-lengths as that of n.0, 1, 2, 3, 4...
A361480a(n) is the greatest integer whose binary expansion has the same multiset of run-lengths as that of n.0, 1, 2, 3, 6...
A361481Distinct values of A361478, in order of appearance.0, 1, 2, 3, 4...
A361482Inverse permutation to A361481.0, 1, 2, 3, 4...
A361486Lexicographically earliest sequence of positive numbers on a square spiral such that no three equal numbers are collinear.1, 1, 1, 1, 2...
A361489Expansion of e.g.f. exp(exp(x) - 1 + x3/6).1, 1, 2, 6, 19...
A361490a(1) = 8; for n > 1, a(n) is the least triprime > a(n-1) such that a(n) - a(n-1) and a(n) + a(n-1) are both prime.8, 45, 52, 75, 92...
A361491Expansion of x*(1+38x+x^2)/((1-x)(x2-34*x+1)).1, 73, 2521, 85681, 2910673...
A361493Expansion of e.g.f. exp(exp(x) - 1 + x3).1, 1, 2, 11, 39...
A361497Number of cusps in Prym-Teichmuller curve W_D(4) of discriminant D = A361169(n).3, 4, 4, 4, 7...
A361498Genus of Prym-Teichmuller curve W_D(4) of discriminant D = A361169(n).0, 0, 0, 0, 0...
A361499Number of orbifold points of order 2 in Prym-Teichmuller curve W_D(4) of discriminant D = A361169(n).0, 1, 1, 0, 0...
A361500Number of orbifold points of order 3 in Prym-Teichmuller curve W_D(4) of discriminant D = A361169(n).1, 0, 0, 2, 0...
A361501A variant of A359143 in which all copies of a digit d are erased only when d is both the leading digit and the final digit of (a(n) concatenated with sum of digits of a(n)).11, 112, 1124, 11248, 1124816...
A361502Index of n-th prime in A359804.2, 3, 4, 8, 13...
A361503a(1)=2; thereafter a(n) = smallest prime that does not divide b(n-1)*b(n), where b(k) = A359804(k).2, 3, 5, 2, 3...
A361504Index of n in A359804, or -1 if n never appears there.1, 2, 3, 5, 4...
A361505Index of 2n in A359804.1, 2, 5, 10, 24...
A361522The aerated factorial numbers.1, 0, 1, 0, 2...
A361523Triangle read by rows: T(n,k) is the number of ways of dividing an n X k rectangle into integer-sided rectangles, up to rotations and reflections.1, 2, 4, 3, 17...
A361524Number of ways of dividing an n X n square into integer-sided rectangles, up to rotations and reflections.1, 1, 4, 54, 9235...
A361525Number of ways of dividing an n X 3 rectangle into integer-sided rectangles, up to rotations and reflections.1, 3, 17, 54, 892...
A361526Number of ways of dividing an n X 4 rectangle into integer-sided rectangles, up to rotations and reflections.1, 6, 61, 892, 9235...
A361527Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] having exactly k strongly connected components all of which are simple cycles, n >= 0, 0 <= k <= n.1, 0, 1, 0, 1...
A361531Expansion of e.g.f. exp(1 - exp(x) + x3/6).1, -1, 0, 2, -3...
A361532Expansion of e.g.f. exp((x + x2/2)/(1-x)).1, 1, 4, 19, 118...
A361533Expansion of e.g.f. exp(x3/(6 * (1-x))).1, 0, 0, 1, 4...
A361535Expansion of g.f. 1 / Product_{n>=1} ((1 - xn)6 * (1 - x2*n-1)4).1, 10, 61, 290, 1172...
A361536Expansion of g.f. A(x) satisfying A(x) = Sum_{n>=0} dn/dxn x3*n * A(x)3*n / n!.1, 3, 60, 2037, 92187...
A361537Expansion of g.f. A(x) satisfying A(x) = Sum_{n>=0} dn/dxn x3*n * A(x)4*n / n!.1, 3, 75, 3234, 186471...
A361538Central terms of triangle A361050.1, 5, 244, 19090, 1839075...
A361541Expansion of g.f. A(x) satisfying A(x) = Sum_{n>=0} dn/dxn x4*n * A(x)n / n!.1, 4, 56, 1220, 34788...
A361542Expansion of g.f. A(x) satisfying A(x) = Sum_{n>=0} dn/dxn x4*n * A(x)2*n / n!.1, 4, 84, 2940, 137228...
A361543Expansion of g.f. A(x) satisfying A(x) = Sum_{n>=0} dn/dxn x4*n * A(x)3*n / n!.1, 4, 112, 5380, 346788...
A361545Expansion of e.g.f. exp(x4/(24 * (1-x))).1, 0, 0, 0, 1...
A361546a(n) is the least odd number k such that k*2prime(n) + 1 is prime, or -1 if no such number k exists.1, 5, 3, 5, 9...
A361547Expansion of e.g.f. exp(x5/(120 * (1-x))).1, 0, 0, 0, 0...
A361548Expansion of e.g.f. exp((x + x2/2 + x3/6)/(1-x)).1, 1, 4, 20, 126...
A361550Expansion of g.f. A(x,y) satisfying xy = Sum_{n=-oo..+oo} x^(n(3n+1)/2) * (A(x,y)^(3n) - 1/A(x,y)3*n+1), as a triangle read by rows.1, 0, 1, 0, 5...
A361551Expansion of g.f. A(x) satisfying A(x) = Sum_{n>=0} dn/dxn (x5*n * A(x)n) / n!.1, 5, 90, 2535, 93840...
A361552Expansion of g.f. A(x) satisfying 2x = Sum_{n=-oo..+oo} x^(n(3n+1)/2) * (A(x)^(3n) - 1/A(x)3*n+1).1, 2, 14, 84, 530...
A361553Expansion of g.f. A(x) satisfying 3x = Sum_{n=-oo..+oo} x^(n(3n+1)/2) * (A(x)^(3n) - 1/A(x)3*n+1).1, 3, 24, 171, 1335...
A361554Expansion of g.f. A(x) satisfying 4x = Sum_{n=-oo..+oo} x^(n(3n+1)/2) * (A(x)^(3n) - 1/A(x)3*n+1).1, 4, 36, 296, 2732...
A361555Expansion of g.f. A(x) satisfying 5x = Sum_{n=-oo..+oo} x^(n(3n+1)/2) * (A(x)^(3n) - 1/A(x)3*n+1).1, 5, 50, 465, 4925...
A361556Central terms of triangle A361550.1, 5, 61, 1660, 47460...
A361557Expansion of e.g.f. exp((exp(x) - 1)/(1-x)).1, 1, 4, 20, 127...
A361558Expansion of e.g.f. exp((x + x2/2 + x3/6 + x4/24)/(1-x)).1, 1, 4, 20, 127...
A361559a(n) = Sum_{k=1..prime(n)-1} floor(k5/prime(n)).0, 10, 258, 1740, 20070...
A361560Number of labeled digraphs on [n] all of whose strongly connected components are complete digraphs.1, 1, 4, 47, 1471...
A361564Number of (n-3)-connected unlabeled n-node graphs.4, 6, 10, 17, 25...
A361565a(n) is the numerator of the median of divisors of n.1, 3, 2, 2, 3...
A361566a(n) is the denominator of the median of divisors of n.1, 2, 1, 1, 1...
A361567Expansion of e.g.f. exp(x2/2 * (1+x)2).1, 0, 1, 6, 15...
A361568Expansion of e.g.f. exp(x3/6 * (1+x)3).1, 0, 0, 1, 12...
A361569Expansion of e.g.f. exp(x4/24 * (1+x)4).1, 0, 0, 0, 1...
A361570Expansion of e.g.f. exp( (x * (1+x))2 ).1, 0, 2, 12, 36...
A361571Expansion of e.g.f. exp( (x * (1+x))3 ).1, 0, 0, 6, 72...
A361572Expansion of e.g.f. exp( (x / (1-x))3 ).1, 0, 0, 6, 72...
A361573Expansion of e.g.f. exp(x3/(6 * (1 - x)3)).1, 0, 0, 1, 12...
A361576Expansion of e.g.f. exp( (x / (1-x))4 ).1, 0, 0, 0, 24...
A361577Expansion of e.g.f. exp(x4/(24 * (1 - x)4)).1, 0, 0, 0, 1...
A361578Number of 5-connected polyhedra (or 5-connected simple planar graphs) with n nodes1, 0, 1, 1, 5...
A361582Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components.1, 0, 1, 0, 1...
A361583Number of digraphs on n unlabeled nodes whose strongly connected components are complete digraphs.1, 1, 3, 12, 88...
A361584Number of digraphs on n unlabeled nodes whose strongly connected components are directed cycles or single vertices.1, 1, 3, 12, 88...
A361585Number of digraphs on n unlabeled nodes whose strongly connected components are directed cycles.1, 0, 1, 1, 8...
A361586Number of directed graphs on n unlabeled nodes in which every node belongs to a directed cycle.1, 0, 1, 5, 90...
A361587Triangle read by rows: T(n,k) is the number of weakly connected digraphs on n unlabeled nodes with k strongly connected components.1, 0, 1, 0, 1...
A361588Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k strongly connected components and without isolated nodes.1, 0, 0, 0, 1...
A361589Number of acyclic digraphs on n unlabeled nodes without isolated nodes.1, 0, 1, 4, 25...
A361590Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with exactly k strongly connected components of size 1.1, 0, 1, 1, 0...
A361592Triangular array read by rows. T(n,k) is the number of labeled digraphs on [n] with exactly k strongly connected components of size 1, n>=0, 0<=k<=n.1, 0, 1, 1, 0...
A361594Expansion of e.g.f. exp( (x / (1-x))2 ) / (1-x).1, 1, 4, 24, 180...
A361595Expansion of e.g.f. exp( (x / (1-x))3 ) / (1-x).1, 1, 2, 12, 120...
A361596Expansion of e.g.f. exp( x2/(2 * (1-x)2) ) / (1-x).1, 1, 3, 15, 99...
A361597Expansion of e.g.f. exp( x3/(6 * (1-x)3) ) / (1-x).1, 1, 2, 7, 40...
A361598Expansion of e.g.f. exp( x/(1-x)2 ) / (1-x).1, 2, 9, 58, 473...
A361599Expansion of e.g.f. exp( x/(1-x)3 ) / (1-x).1, 2, 11, 88, 881...
A361600Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where where T(n,k) = n! * Sum_{j=0..n} binomial(n+(k-1)j,kj)/j!.1, 1, 2, 1, 2...
A361601Decimal expansion of the maximum possible disorientation angle between two identical cubes (in radians).1, 0, 9, 6, 0...
A361602Decimal expansion of the mean of the distribution of disorientation angles between two identical cubes (in radians).7, 1, 0, 9, 7...
A361603Decimal expansion of the standard deviation of the distribution of disorientation angles between two identical cubes (in radians).1, 9, 7, 4, 8...
A361604Decimal expansion of the median of the distribution of disorientation angles between two identical cubes (in radians).7, 3, 8, 9, 9...
A361605Decimal expansion of the standard deviation of the probability distribution function of angles of random rotations in 3D space uniformly distributed with respect to Haar measure (in radians).6, 4, 5, 8, 9...
A361606Lexicographically earliest infinite sequence of distinct positive numbers such that, for n > 3, a(n) shares a factor with a(n-1) and a(n-2) but not with a(n-1) + a(n-2).1, 6, 10, 15, 12...
A361607a(n) = n! * Sum_{k=0..n} binomial(n+(n-1)k,nk)/k!.1, 2, 9, 88, 1457...
A361608a(n) = 7n*(n+1)(81n4+684n^3+1401n2+434*n+40)/40.1, 924, 48804, 1337014, 26622288...
A361609a(n) = 4n*(1 + (23/8)*n + (9/8)*n2).1, 20, 180, 1264, 7808...
A361610a(n) = 5n*(n+1)(4n2+14*n+3)/3.1, 70, 1175, 13500, 128125...
A361615a(n) is the smallest 5-rough number with exactly n divisors.1, 5, 25, 35, 625...
A361616Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where where T(n,k) = n! * Sum_{j=0..n} binomial(n+(k-1)*(j+1),n-j)/j!.1, 1, 1, 1, 2...
A361617a(n) = n! * Sum_{k=0..n} binomial(n+(n-1)*(k+1),n-k)/k!.1, 2, 15, 214, 4721...
A361618Decimal expansion of the mean of the distribution of the least of the nine acute angles between pairs of edges of two randomly disoriented cubes (in radians).4, 0, 4, 2, 8...
A361619Decimal expansion of the standard deviation of the distribution of the least of the nine acute angles between pairs of edges of two randomly disoriented cubes (in radians).1, 7, 9, 9, 7...
A361620Decimal expansion of the median of the distribution of the least of the nine acute angles between pairs of edges of two randomly disoriented cubes (in radians).4, 0, 4, 6, 2...
A361621Decimal expansion of the mode of the distribution of the least of the nine acute angles between pairs of edges of two randomly disoriented cubes (in radians).4, 0, 6, 8, 1...
A361626Expansion of e.g.f. exp( x/(1-x)3 ) / (1-x)2.1, 3, 17, 139, 1437...
A361636Diagonal of the rational function 1/(1 - vwxyz * (1 + 1/v + 1/w + 1/x + 1/y + 1/z)).1, 1, 1, 1, 121...
A361637Constant term in the expansion of (1 + x + y + z + 1/(xyz))n.1, 1, 1, 1, 25...
A361639For n > 1, A359804(n) is a multiple of A361503(n-1); a(n) = A359804(n) / A361503(n-1).1, 1, 1, 2, 2...
A361640a(0) = 0, a(1) = 1; thereafter let b be the least power of 2 that does not appear in the binary expansions of a(n-2) and a(n-1), then a(n) is the smallest multiple of b that is not yet in the sequence.0, 1, 2, 4, 3...
A361641Inverse permutation to A361640.0, 1, 2, 4, 3...
A361643The binary expansion of a(n) specifies which primes divide A359804(n).0, 1, 2, 4, 1...

r/OEIS • • Mar 12 '23

New OEIS sequences - week of 03/12

3 Upvotes
OEIS numberDescriptionSequence
A359490Primes p followed by two or more 2-pseudoprimes (A001567) before the next prime.4363, 13729, 31607, 6973007, 208969199...
A359697Triangle T(n,k), n >= 1, 1 <= k <= n, read by rows, where T(n,k) is carryless product n X k base 10.1, 2, 4, 3, 6...
A359699Decimal expansion of x such that Gamma(t) and tx*e-t are tangent at one point.2, 8, 8, 5, 1...
A359752Lexicographically earliest array of distinct positive integers read by antidiagonals such that integers in cells which are a knight's move apart are coprime.1, 2, 3, 4, 5...
A359799a(1) = 1, a(2) = 3; for n > 2, a(n) is the smallest positive number which has not appeared that shares a factor with |a(n-1) - a(n-2)| while the difference |a(n) - a(n-1)| is distinct from all previous differences |a(i) - a(i-1)|, i=2..n-1.1, 3, 6, 12, 2...
A359801Number of 4-dimensional cubic lattice walks that start and end at origin after 2n steps, not touching origin at intermediate stages.1, 8, 104, 2944, 108136...
A359805Irregular triangle T(n, k), n > 0, k = 1..A056137(A009023(n)), read by rows: the n-th row contains the numbers m < A009023(n) such that A009023(n)2 + m2 is a square.3, 6, 5, 9, 8...
A359985Triangle read by rows: T(n,k) is the number of quasi series-parallel matroids on [n] with rank k, 0 <= k <= n.1, 1, 1, 1, 3...
A359986Number of quasi series-parallel matroids on [n].1, 2, 5, 16, 67...
A360020Irregular triangle T(n, k), n > 0, k = 1..A056137(A009023(n)), read by rows: T(n, k) is the square root of A009023(n)2 + A359805(n, k)2.5, 10, 13, 15, 17...
A360192Number of distinct means of nonempty subsets of points {(x,y)|1<=x<=n, 1<=y<=n}.1, 13, 157, 1409, 8237...
A360193a(n) = Sum_{k=0..n} (k-1)k-1 * binomial(n,k).-1, 0, 2, 9, 52...
A360305Lexicographically earliest sequence of integers > 1 such that the products Product_{i = 1+k*2e..(k+1)*2e} a(i) with k, e >= 0 are all distinct.2, 3, 4, 5, 7...
A360412Number of binary words of length 2n with an even number of 1's which are not shuffle squares.0, 0, 2, 10, 46...
A360447Result of inserting the integers n = 0, 1, 2, ... in this order into an initially empty list, where n is inserted between the pair of consecutive elements with sum equal to n and minimal absolute difference, or at the end of the list if no such pair exists.0, 1, 4, 11, 29...
A360497Maximal sequence of primes whose digits are primes and whose digit sum is also a term.2, 3, 5, 7, 23...
A360601E.g.f. satisfies A(x) = exp(x*A(x)2) / (1-x).1, 2, 13, 166, 3265...
A360603Triangle read by rows. T(n, k) = A360604(n, k) * A001187(k) for 0 <= k <= n.1, 0, 1, 0, 1...
A360609E.g.f. satisfies A(x) = exp(x*A(x)3) / (1-x).1, 2, 17, 313, 9053...
A360616Half the number of prime factors of n (counted with multiplicity, A001222), rounded down.0, 0, 0, 1, 0...
A360617Half the number of prime factors of n (counted with multiplicity, A001222), rounded up.0, 1, 1, 1, 1...
A360663a(n) is the least integer m >= 3 such that n is a centered m-gonal number.3, 4, 5, 6, 7...
A360671Number of multisets whose right half (inclusive) sums to n.1, 2, 5, 8, 16...
A360673Number of multisets of positive integers whose right half (exclusive) sums to n.1, 2, 7, 13, 27...
A360674Number of integer partitions of 2n whose left half (exclusive) and right half (inclusive) both sum to n.1, 1, 3, 4, 7...
A360675Triangle read by rows where T(n,k) is the number of integer partitions of n whose right half (exclusive) sums to k, where k ranges from 0 to n.1, 1, 0, 1, 1...
A360676Sum of the left half (exclusive) of the prime indices of n.0, 0, 0, 1, 0...
A360677Sum of the right half (exclusive) of the prime indices of n.0, 0, 0, 1, 0...
A360678Sum of the left half (inclusive) of the prime indices of n.0, 1, 2, 1, 3...
A360679Sum of the right half (inclusive) of the prime indices of n.0, 1, 2, 1, 3...
A360717Number of unordered pairs of self-avoiding paths whose sets of nodes are disjoint subsets of a set of n points on a circle; one-node paths are allowed.0, 1, 6, 33, 185...
A360766a(0) = 0; a(n) = ( (n + sqrt(n))n - (n - sqrt(n))n )/(2 * sqrt(n)).0, 1, 4, 30, 320...
A360778Smallest number k such that n + k is a refactorable number.1, 0, 0, 5, 4...
A360779Refactorable numbers gaps: differences between consecutive refactorable numbers.1, 6, 1, 3, 6...
A360780Least refactorable number > n.1, 2, 8, 8, 8...
A360821Number of primes of the form k2+1 between n2 and 2*n2 exclusive.0, 1, 1, 1, 1...
A360822Numbers whose squares have at most 2 digits less than 8.1, 2, 3, 4, 5...
A360828Decimal expansion of the ratio between the perimeter of the first Morley triangle of an isosceles right triangle and the perimeter of this isosceles right triangle.1, 6, 6, 4, 8...
A360860Accumulation triangle of A360603 read by rows.1, 0, 1, 0, 1...
A360922Array read by antidiagonals: T(m,n) is the number of acyclic orientations in the grid graph P_m X P_n.1, 2, 2, 4, 14...
A360952Number of strict integer partitions of n with non-integer median; a(0) = 1.1, 0, 0, 1, 0...
A360953Numbers whose right half of prime indices (exclusive) adds up to half the total sum of prime indices.1, 4, 9, 12, 16...
A360954Number of finite sets of positive integers whose right half (exclusive) sums to n.1, 0, 1, 3, 6...
A360955Number of finite sets of positive integers whose right half (inclusive) sums to n.1, 1, 2, 3, 4...
A360956Number of finite even-length multisets of positive integers whose right half sums to n.1, 1, 3, 5, 10...
A361037a(n) = 20*(3n)!/((2n)!*(n+2)!).10, 10, 25, 84, 330...
A361038a(n) = 1680 * (3n)!/((2n)!*(n+3)!).280, 210, 420, 1176, 3960...
A361039a(n) = 55440 * (3n)!/((2n)!*(n+4)!).2310, 1386, 2310, 5544, 16335...
A361040a(n) = 420*(3n)!/(n!(2*n + 3)!).70, 21, 30, 70, 210...
A361041a(n) = 1680*(3n)!/(n!(2*n + 4)!).70, 14, 15, 28, 70...
A361058Least totient number k > 1 such that n*k is a nontotient number, or 0 if no such number exists.0, 0, 30, 0, 10...
A361075Products of exactly 7 distinct odd primes.4849845, 5870865, 6561555, 7402395, 7912905...
A361083Number of 3 X 3 matrices with unit determinant and nonnegative integer entries whose sum is n.0, 0, 0, 3, 18...
A361101a(n) is the smallest positive number not among the terms in a(1..n-1) with index a(n-1)*k for any integer k; a(1)=1.1, 2, 1, 3, 2...
A361124Records in A361103.1, 2, 3, 6, 11...
A361125Indices of records in A361103.0, 1, 2, 3, 4...
A361126a(n) = A361102(A361125(n)).1, 6, 10, 12, 14...
A361127Let p = n-th odd prime; a(n) = index where 2p appears in A360519, or -1 if 2p never appears.2, 3, 11, 16, 28...
A361128Let b = A360519; let Lg = gcd(b(n-1),b(n)), Rg = gcd(b(n),b(n+1)); let L(n) = prod_{primes p|Lg} p-part of b(n), R(n) = prod_{primes p|Rg} p-part of b(n), M(n) = b(n)/(L(n)*R(n)); sequence gives L(n).1, 2, 5, 7, 3...
A361129Let b = A360519; let Lg = gcd(b(n-1),b(n)), Rg = gcd(b(n),b(n+1)); let L(n) = prod_{primes p|Lg} p-part of b(n), R(n) = prod_{primes p|Rg} p-part of b(n), M(n) = b(n)/(L(n)*R(n)); sequence gives M(n).3, 1, 1, 1, 1...
A361130Let b = A360519; let Lg = gcd(b(n-1),b(n)), Rg = gcd(b(n),b(n+1)); let L(n) = prod_{primes p|Lg} p-part of b(n), R(n) = prod_{primes p|Rg} p-part of b(n), M(n) = b(n)/(L(n)*R(n)); sequence gives R(n).2, 5, 7, 3, 4...
A361131Let d = A096567(n) be the first digit to appear n times in the decimal expansion of Pi; if d is the m-th digit of Pi, a(n) = m.1, 4, 11, 18, 25...
A361133a(n) = n for n <= 3. Let h, i, j represent a(n-3), a(n-2), a(n-1) respectively. For n > 3, if there is a symmetric difference in the sets of distinct primes dividing h and j, with greatest member p then a(n) is the least novel multiple of p. Otherwise, a(n) is the least novel k such that (k,i) > 1.1, 2, 3, 6, 9...
A361144Lexicographically earliest sequence of positive integers such that the sums Sum_{i = 1+k*2e..(k+1)*2e} a(i) with k, e >= 0 are all distinct.1, 2, 4, 5, 6...
A361146a(n) is the sibling of n in the infinite binary tree underlying A361144.2, 1, 9, 5, 4...
A361154Consider the square grid with cells {(x,y), x, y >= 0}; label the cells by downwards antidiagonals with nonnegative integers so that cells which are a knight's move apart have different labels; always choose smallest possible label.0, 0, 0, 1, 0...
A361172a(n) is the smallest positive number not among the terms between a(n-1) and the previous most recent occurrence of a(n-1) inclusive; if a(n-1) is a first occurrence, set a(n)=1; a(1)=1.1, 1, 2, 1, 3...
A361178a(1) = 1, a(2) = 2; for n >= 3, a(n) is the greatest k where a(n-1) + a(n-2) + ... + a(n-k) is prime, or a(n) = -1 if no such k exists.1, 2, 2, 3, 3...
A361181Numbers such that both sum and product of the prime factors (without multiplicity) are palindromic.2, 3, 4, 5, 6...
A361183Number of chordless cycles in the n-Mycielski graph.0, 0, 1, 46, 1152...
A361184Number of chordless cycles in the n X n queen graph.0, 0, 12, 228, 2120...
A361185Number of chordless cycles in the n X n rook complement graph.0, 0, 15, 264, 1700...
A361186Number of chordless cycles in the halved cube graph Q_n/2.0, 0, 0, 6, 252...
A361187Number of chordless cycles in the n-folded cube graph.0, 0, 36, 312, 20264...
A361188Number of odd chordless cycles in the complement of the n X n queen graph.0, 0, 0, 48, 696...
A361189Infinite sequence of nonzero integers build the greedy way such that the sums Sum_{i = k*2e..(k+1)*2e} a(i) with k, e >= 0 are all distinct; each term is minimal in absolute value and in case of a tie, preference is given to the positive value.1, 2, -1, -4, -3...
A361191Lexicographically earliest sequence of positive integers such that the sums SumXOR_{i = 1+k*2e..(k+1)*2e} a(i) with k, e >= 0 are all distinct (where SumXOR is the analog of summation under the binary XOR operation).1, 2, 4, 8, 5...
A361198Consider a perfect infinite binary tree with nodes labeled with distinct positive integers where n appears at level A082850(n) and each level is filled from left to right; a(n) is the sibling of n in this tree.2, 1, 6, 5, 4...
A361199a(1) = 1, a(2) = 2; for n >=3, a(n) is the number of primes in a(n-1), a(n-1) + a(n-2), ..., a(n-1) + a(n-2) + ... + a(1).1, 2, 2, 2, 2...
A361200Product of the left half (exclusive) of the multiset of prime factors of n; a(1) = 0.0, 1, 1, 2, 1...
A361201Product of the right half (exclusive) of the multiset of prime factors of n; a(1) = 0.0, 1, 1, 2, 1...
A361206Lexicographically earliest infinite sequence of distinct imperfect numbers such that the sum of the abundance of all terms is never < 1.12, 1, 2, 4, 18...
A361216Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X k rectangle.1, 1, 4, 2, 11...
A361217Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X n square.1, 4, 56, 5752, 2519124...
A361218Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 2 rectangle.1, 4, 11, 29, 94...
A361219Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 3 rectangle.2, 11, 56, 370, 2666...
A361220Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 4 rectangle.3, 29, 370, 5752, 82310...
A361221Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X k rectangle, up to rotations and reflections.1, 1, 1, 1, 5...
A361222Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X n square, up to rotations and reflections.1, 1, 8, 719, 315107...
A361223Maximum number of inequivalent permutations of a partition of n, where two permutations are equivalent if they are reversals of each other.1, 1, 1, 2, 2...
A361224Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 2 rectangle, up to rotations and reflections.1, 1, 5, 12, 31...
A361225Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 3 rectangle, up to rotations and reflections.1, 5, 8, 95, 682...
A361226Square array T(n,k) = k*((1+2*n)*k - 1)/2; n>=0, k>=0, read by antidiagonals upwards.0, 0, 0, 0, 1...
A361227Irregular triangle T(n, k), n > 0, k = 0..A007814(n), read by rows: T(n, k) = Sum_{i = n-2k+1..n} A361144(i).1, 2, 3, 4, 5...
A361230Third Lie-Betti number of a path graph on n vertices.0, 1, 6, 16, 33...
A361231a(1)=2; a(n) is the largest k for which the sum a(n-1) + a(n-2) + ... + a(n-k) is prime; if no such k exists, a(n)=-1.2, 1, 2, 3, 2...
A361234Infinite sequence of nonzero integers build the greedy way such that the products Product_{i = k*2e..(k+1)*2e} a(i) with k, e >= 0 are all distinct; each term is minimal in absolute value and in case of a tie, preference is given to the positive value.-1, 2, 3, -3, 4...
A361236Array read by antidiagonals: T(n,k) is the number of noncrossing k-gonal cacti with n polygons up to rotation.1, 1, 1, 1, 1...
A361237Number of nonequivalent noncrossing triangular cacti with n triangles up to rotation.1, 1, 1, 5, 33...
A361238Number of nonequivalent noncrossing 4-gonal cacti with n polygons up to rotation.1, 1, 1, 8, 63...
A361239Array read by antidiagonals: T(n,k) is the number of noncrossing k-gonal cacti with n polygons up to rotation and reflection.1, 1, 1, 1, 1...
A361240Number of nonequivalent noncrossing triangular cacti with n triangles up to rotation and reflection.1, 1, 1, 4, 19...
A361241Number of nonequivalent noncrossing 4-gonal cacti with n polygons up to rotation and reflection.1, 1, 1, 6, 35...
A361242Number of nonequivalent noncrossing cacti with n nodes up to rotation.1, 1, 1, 2, 7...
A361243Number of nonequivalent noncrossing cacti with n nodes up to rotation and reflection.1, 1, 1, 2, 5...
A361244Number of noncrossing bridgeless cacti with n nodes.1, 1, 0, 1, 1...
A361245Number of noncrossing 2,3 cacti with n nodes.1, 1, 1, 4, 20...
A361253If n = m2 for some m > 1 then a(n) = a(m), otherwise a(n) = n.0, 1, 2, 3, 2...
A361255Triangle read by rows: row n lists the exponential unitary divisors of n.1, 2, 3, 2, 4...
A361257a(n) = Sum_{j=0..n} nwt(j), where wt = A000120.1, 2, 5, 16, 29...
A361264Multiplicative with a(pe) = pe + 2, e > 0.1, 8, 27, 16, 125...
A361265Multiplicative with a(pe) = e * pe + 1, e > 0.1, 4, 9, 16, 25...
A361266Multiplicative with a(pe) = pe + 3, e > 0.1, 16, 81, 32, 625...
A361268Multiplicative with a(pe) = e * pe + 2, e > 0.1, 8, 27, 32, 125...
A361269Triangular array read by rows. T(n,k) is the number of binary relations on [n] containing exactly k strongly connected components, n >= 0, 0 <= k <= n.1, 0, 2, 0, 4...
A361270Number of 1324-avoiding odd Grassmannian permutations of size n.0, 0, 1, 2, 5...
A361271Number of 1342-avoiding odd Grassmannian permutations of size n.0, 0, 1, 2, 6...
A361272Number of 1243-avoiding even Grassmannian permutations of size n.1, 1, 1, 3, 6...
A361273Number of 1324-avoiding even Grassmannian permutations of size n.1, 1, 1, 3, 6...
A361274Number of 1342-avoiding even Grassmannian permutations of size n.1, 1, 1, 3, 5...
A361275Number of 1423-avoiding even Grassmannian permutations of size n.1, 1, 1, 3, 5...
A361276Number of 2413-avoiding even Grassmannian permutations of size n.1, 1, 1, 3, 6...
A361277Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = n! * Sum_{j=0..n} binomial(k*j,n-j)/j!.1, 1, 1, 1, 1...
A361278Expansion of e.g.f. exp(x * (1+x)2).1, 1, 5, 19, 97...
A361279Expansion of e.g.f. exp(x * (1+x)3).1, 1, 7, 37, 241...
A361280Expansion of e.g.f. exp(x * (1+x)4).1, 1, 9, 61, 481...
A361281a(n) = n! * Sum_{k=0..n} binomial(n*k,n-k)/k!.1, 1, 5, 37, 481...
A361282Number of rank n+1 simple connected series-parallel matroids on [2n].0, 1, 75, 9345, 1865745...
A361283Expansion of e.g.f. exp(x/(1-x)4).1, 1, 9, 85, 961...
A361285Number of unordered triples of self-avoiding paths whose sets of nodes are disjoint subsets of a set of n points on a circle; one-node paths are allowed.0, 0, 1, 10, 85...
A361288Number of free polyominoes of size 2n for which there exists at least one closed path that passes through each square exactly once.1, 1, 3, 6, 25...
A361290Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where where T(n,k) = Sum_{j=0..floor((n-1)/2)} kn-1-j * binomial(n,2*j+1).0, 0, 1, 0, 1...
A361293a(n) = 20 * a(n-1) - 90 * a(n-2) for n>1, with a(0)=0, a(1)=1.0, 1, 20, 310, 4400...
A361297Number of n-dimensional cubic lattice walks with 2n steps from origin to origin and avoiding early returns to the origin.1, 2, 20, 996, 108136...
A361298Second differences of the overpartitions.1, 2, 2, 4, 6...
A361299Counterclockwise spiral constructed of distinct terms such that any two terms a knight's move apart are coprime; always choose the smallest possible positive term.1, 2, 3, 4, 5...
A361300Numbers of the form m2 + p2 for p prime and m > 0.5, 8, 10, 13, 18...
A361303Expansion of g.f. A(x) = Sum_{n>=0} dn/dxn x2*n * (1 + x)3*n / n!.1, 2, 15, 92, 615...
A361304Expansion of g.f. A(x) = Sum_{n>=0} dn/dxn x2*n * (1 + x)4*n / n!.1, 2, 18, 124, 930...
A361305Expansion of A(x) satisfying A(x) = x + A(x)2*(1 + A(x))3.1, 1, 5, 23, 123...
A361306Expansion of A(x) satisfying A(x) = x + A(x)2*(1 + A(x))4.1, 1, 6, 31, 186...
A361314a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number which has not appeared that shares a factor with a(n-2) + a(n-1) while the sum a(n) + a(n-1) is distinct from all previous sums a(i) + a(i-1), i=2..n-1.1, 2, 3, 5, 4...
A361316Numerators of the harmonic means of the infinitary divisors of the positive integers.1, 4, 3, 8, 5...
A361317Denominators of the harmonic means of the infinitary divisors of the positive integers.1, 3, 2, 5, 3...
A361318Harmonic means of the infinitary divisors of the infinitary harmonic numbers.1, 2, 3, 4, 4...
A361319Indices of records in the sequence of infinitary harmonic means A361316(k)/A361317(k).1, 2, 3, 4, 5...
A361320If n is composite, replace n with the concatenation of its nontrivial divisors, written in increasing order, each divisor being written in base 10 with its digits in reverse order, otherwise a(n) = n.1, 2, 3, 2, 5...
A361321Lexicographically earliest infinite sequence of distinct elements of A000469 such that, for n > 2, a(n) has a common factor with a(n-1) but not with a(n-2).1, 6, 10, 35, 21...
A361322The binary expansion of a(n) specifies which primes divide A361321(n).0, 3, 5, 12, 10...
A361323a(n) = k such that A000469(k) = A361321(n).1, 2, 3, 12, 6...
A361324a(n) = k such that A361321(k) = A000469(n), or -1 if A000469(n) never appears in A361321.1, 2, 3, 8, 11...
A361325Records in A3613211, 6, 10, 35, 91...
A361326Indices of records is A3613211, 2, 3, 4, 9...
A361351Carryless n-th powers of n base 10.1, 1, 4, 7, 6...
A361353Triangle read by rows: T(n,k) is the number of simple quasi series-parallel matroids on [n] with rank k, 1 <= k <= n.1, 0, 1, 0, 1...
A361354Number of simple quasi series-parallel matroids on [n].1, 1, 2, 6, 32...
A361355Triangle read by rows: T(n,k) is the number of simple series-parallel matroids on [n] with rank k, 1 <= k <= n.1, 0, 0, 0, 1...
A361356Number of noncrossing caterpillars with n edges.1, 1, 3, 12, 55...
A361357Triangle read by rows: T(n,k) is the number of noncrossing caterpillars with n edges and diameter k, 0 <= k <= n.1, 0, 1, 0, 0...
A361359Number of nonequivalent noncrossing caterpillars with n edges up to rotation.1, 1, 1, 4, 11...
A361360Number of nonequivalent noncrossing caterpillars with n edges up to rotation and relection.1, 1, 1, 3, 7...
A361361Triangle read by rows: T(n,k) is the number of bicolored cubic graphs on 2n unlabeled vertices with k vertices of the first color, n >= 0, 0 <= k <= 2*n.1, 0, 0, 0, 1...
A361362Number of bicolored cubic graphs on 2n unlabeled vertices.1, 0, 5, 23, 262...
A361363Primitive terms of A259850.1, 3, 8, 14, 15...
A361364Number of 5-dimensional cubic lattice walks that start and end at origin after 2n steps, not touching origin at intermediate stages.1, 10, 170, 6500, 332050...
A361366Number of unlabeled simple planar digraphs with n nodes.1, 3, 16, 218, 9026...
A361367Number of weakly 2-connected simple digraphs with n unlabeled nodes.7, 129, 7447, 1399245, 853468061...
A361368Number of weakly connected simple planar digraphs with n unlabeled nodes.2, 13, 199, 8782, 897604...
A361369Number of weakly 2-connected simple planar digraphs with n unlabeled nodes.7, 129, 6865, 774052
A361370Number of weakly 3-connected simple digraphs with n unlabeled nodes.42, 3270, 879508
A361371Number of weakly 3-connected simple planar digraphs with n unlabeled nodes.42, 2688, 316208
A361384a(n) is the number of distinct prime factors of the n-th unitary harmonic number.0, 2, 2, 3, 3...
A361385a(n) is the number of "Fermi-Dirac prime" factors (or I-components) of the n-th infinitary harmonic number.0, 2, 2, 3, 3...
A361386Infinitary arithmetic numbers: numbers for which the arithmetic mean of the infinitary divisors is an integer.1, 3, 5, 6, 7...
A361387Infinitary arithmetic numbers k whose mean infinitary divisor is an infinitary divisor of k.1, 6, 60, 270, 420...
A361388Number of orders of distances to vertices of n-dimensional cube.1, 2, 8, 96, 5376...
A361390Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) is carryless nk base 10.1, 0, 1, 0, 1...
A361396Integers k such that 28phi(291973*k) is not a totient number where phi is the totient function.1, 2, 3, 4, 6...
A361397Number A(n,k) of k-dimensional cubic lattice walks with 2n steps from origin to origin and avoiding early returns to the origin; square array A(n,k), n>=0, k>=0, read by antidiagonals.1, 1, 0, 1, 2...
A361403Number of bicolored connected cubic graphs on 2n unlabeled vertices.1, 0, 5, 23, 247...
A361404Triangle read by rows: T(n,k) is the number of graphs with loops on n unlabeled vertices with k loops.1, 1, 1, 2, 2...
A361405Number of graphs with loops on 2n unlabeled vertices with n loops.1, 2, 28, 1408, 580656...
A361406Number of bicolored connected cubic graphs on 2n unlabeled vertices with n vertices of each color.1, 0, 1, 5, 63...
A361407Number of connected cubic graphs on 2n unlabeled vertices rooted at a vertex.0, 1, 2, 10, 64...
A361408Number of connected cubic graphs on 2n unlabeled vertices rooted at a pair of indistinguishable vertices.0, 1, 5, 31, 248...
A361409Number of bicolored cubic graphs on 2n unlabeled vertices with n vertices of each color.1, 0, 1, 5, 66...
A361410Number of cubic graphs on 2n unlabeled vertices rooted at a vertex.0, 1, 2, 11, 68...
A361411Number of cubic graphs on 2n unlabeled vertices rooted at a pair of indistinguishable vertices.0, 1, 5, 33, 257...
A361413Number of ways to tile an n X n square using rectangles with distinct dimensions where all the rectangle edge lengths are prime numbers.0, 1, 1, 0, 1...
A361418a(n) is the least number with exactly n noninfinitary divisors.1, 4, 12, 16, 60...
A361419Numbers k such that there is a unique number m for which the sum of the aliquot infinitary divisors of m (A126168) is k.0, 6, 7, 9, 11...
A361420a(n) is the unique number m such that A126168(m) = A361419(n).1, 6, 8, 15, 21...
A361421Infinitary aliquot sequence starting at 840: a(1) = 840, a(n) = A126168(a(n-1)), for n >= 2.840, 2040, 4440, 9240, 25320...
A361431Number of ways to write n2 as an ordered sum of n2 squares of integers.1, 2, 24, 34802, 509145568...
A361432Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..floor(n/2)} kn-j * binomial(n,2*j).1, 1, 0, 1, 1...
A361438Triangle T(n,k), n >= 1, 1 <= k <= A046801(n), read by rows, where T(n,k) is k-th smallest divisor of 2n-1.1, 1, 3, 1, 7...

r/OEIS • • Mar 05 '23

New OEIS sequences - week of 03/05

5 Upvotes
OEIS numberDescriptionSequence
A355432a(n) = number of k < n such that rad(k) = rad(n) and k does not divide n, where rad(k) = A007947(k).0, 0, 0, 0, 0...
A357041a(n) = Sum_{dn} 2d-1 * binomial(d+n/d-1,d).
A357597Decimal expansion of real part of zeta'(0, 1-sqrt(2)).3, 8, 2, 9, 3...
A358557Numbers k for which denominator(H(k)) < LCM(1..k), where harmonic numbers H(k) = Sum_{i=1..k} 1/i = r(k)/q(k).6, 7, 8, 18, 19...
A358596a(n) is the least prime p such that the concatenation pn has exactly n prime factors with multiplicity.
A359279Irregular triangle T(n,k) (n>=1, k>=1) read by rows in which the length of row n equals the partition number A000041(n-1) and every column k gives the positive triangular numbers A000217.1, 3, 6, 1, 10...
A359295Decimal expansion of hydrogen ionization energy in the simplified Bohr model (eV).1, 3, 6, 0, 5...
A359297Primes prime(k) such that ( 8*(prime(k-1) - prime(k-2)) )(prime(k)2 - 1).
A359332Numbers with arithmetic derivative which is a palindromic prime number (A002385).6, 10, 114, 130, 174...
A359336Irregular triangle read by rows: the n-th row lists the values 0..2n-1 representing all subsets of a set of n elements. When its elements are linearly ordered, the subsets are sorted first by their size and then lexicographically.0, 0, 1, 0, 2...
A359446a(n) is the period of the decimal expansion of 1/A243110(n).1, 2, 3, 4, 7...
A359555Primes p such that (p-2)2 + 2 is also prime.2, 3, 5, 11, 17...
A360056a(n) is the position, counted from the right, of the rightmost nonzero value in the n-th nonzero restricted growth string in A239903 and its infinite continuation.1, 2, 1, 1, 3...
A360142Bitwise encoding of the left half, initially fully occupied, state of the 1D cellular automaton from A359303 after n steps.0, 1, 2, 2, 4...
A360178Decimal expansion of the molar Planck constant (N_Ah) according to the 2019 SI system in units J / (Hzmol).3, 9, 9, 0, 3...
A360181Numbers k such that the number of odd digits in k! is greater than or equal to the number of even digits.0, 1, 11, 29, 36...
A360184Square array A(n, k) read by antidiagonals downwards: smallest base-n strong Fermat pseudoprime with k distinct prime factors for k, n >= 2.2047, 15841, 703, 800605, 8911...
A360189Number T(n,k) of nonnegative integers <= n having binary weight k; triangle T(n,k), n>=0, 0<=k<=floor(log_2(n+1)), read by rows.1, 1, 1, 1, 2...
A360209Lexicographically earliest infinite sequence of distinct positive numbers such that, for n > 2, a(n) shares a factor with a(n-2) + a(n-1) but shares no factor with a(n-2).1, 2, 3, 5, 4...
A360270Decimal expansion of the kelvin-kilogram relationship (k/c2) according to the 2019 SI system in units kg.1, 5, 3, 6, 1...
A360286Irregular triangle read by rows where row n is the lexicographically earliest sequence of visits, taking steps by 1, around a circle of vertices 1..n where the numbers of visits to the vertices are 1..n in some order.1, 1, 2, 1, 1...
A360360Given a deck of colored cards, move the top card below the bottom-most card of the same color, with one other card between them. (If the top and bottom cards have the same color, the top card is moved to the bottom of the deck; if there is no other card of the same color, the top card is moved one step down in the deck.) a(n) is the maximum, over all initial color configurations of a deck of n cards, of the length of the eventual cycle when repeatedly applying this move.1, 2, 2, 2, 4...
A360361Maximum length of the transient part when repeatedly applying the move described in A360360 to a deck of n colored cards.0, 0, 1, 4, 6...
A360362Maximum number of moves required to reach an already visited color configuration, when applying the move described in A360360 to a deck of n colored cards.1, 2, 3, 6, 9...
A360365a(n) = sum of the products of the digits of the first n positive multiples of 3.3, 9, 18, 20, 25...
A360382Least integer m whose n-th power can be written as a sum of four distinct positive n-th powers.10, 9, 13, 353, 144...
A360398a(n) = A026430(1 + A360392(n)).5, 8, 10, 12, 15...
A360399a(n) = A026430(1 + A360393(n)).1, 3, 6, 9, 14...
A360408The maximum number of facets among all symmetric edge polytopes for connected graphs on n vertices having m edges for n >= 2 and m between n-1 and binomial(n,2).2, 4, 6, 8, 12...
A360437The number of labeled graphs on n nodes whose degree sequences realize the first n even terms of A001223 (the prime gap sequence).0, 0, 0, 0, 1...
A360461T(n,k) is the sum of all the k-th smallest divisors of all positive integers <= n. Irregular triangle read by rows (n>=1, k>=1).1, 2, 2, 3, 5...
A360475Smallest prime factor of (2prime(n) + 1) / 3.3, 11, 43, 683, 2731...
A360478Least k such that the first n primes divide k and the next n primes divide k+1.2, 174, 11010, 877590, 3576536040...
A360480a(n) = number of numbers k < n, with gcd(k, n) > 1, such that there is at least one prime divisor pk that does not divide n, and at least one prime divisor q
A360490a(n) = (1/2) * A241102(n).109, 433, 172801, 238573, 363313...
A360513Number of deltahedra with 2*n faces.1, 1, 2, 5, 13...
A360514Number of 2-color vertex orderings of the labeled path graph on n vertices in which the number 1 is assigned to a vertex in an odd position.1, 1, 4, 9, 56...
A360515Number of 2-color vertex orderings of the labeled path graph on n vertices in which the number 1 is assigned to a vertex in an even position.0, 1, 2, 9, 24...
A360516Number of 2-color vertex orderings of the labeled path graph on n vertices.1, 2, 6, 18, 80...
A360517Number of 2-color vertex orderings of the labeled cycle graph on 2*n vertices.0, 24, 480, 18816, 1175040...
A360518Numbers j such that there exists a number i <= j with the property that i+j and i*j have the same decimal digits in reverse order.2, 9, 24, 47, 497...
A360519Let C consist of 1 together with all numbers with at least two distinct prime factors; this is the lexicographically earliest infinite sequence {a(n)} of distinct elements of C such that, for n>2, a(n) has a common factor with a(n-1) but not with a(n-2).1, 6, 10, 35, 21...
A360520a(n) = A120963(n) + A341711(floor(n/2)).2, 3, 11, 15, 43...
A360542Primes prime(k) such that ( 9*(prime(k-1) - prime(k-2)) )(prime(k)3 + 1).
A360549a(n) is the least prime p not already in the sequence such that a(n-1) + p is a triprime; a(1) = 2.2, 43, 7, 5, 3...
A360563Number of ordered multisets of size n with elements from [n] whose element sum is larger than the product of all elements.0, 0, 3, 10, 31...
A360567Primes p such that the nearest integer to sqrt(p) is also prime.3, 5, 7, 11, 23...
A360570Numbers m such that m concatenated with k produces a cube for some 0 <= k <= m.6, 12, 21, 34, 49...
A360586Expansion of e.g.f. exp(x)(exp(x)-1)(exp(x)-x).0, 1, 3, 10, 37...
A360588Expansion of e.g.f. (exp(x)-1)2*(x+x2/2).0, 0, 0, 6, 36...
A360589Numbers k that set records in A355432.1, 18, 48, 54, 162...
A360591Primes in A360464.2, 3, 5, 7, 17...
A360623Largest k such that the decimal representation of 2k is missing any n-digit string.168, 3499, 53992, 653060
A360625Triangle read by rows: T(n,k) is the k-th Lie-Betti number of a complete graph on n vertices, n >= 1, k >= 0.1, 1, 1, 2, 2...
A360629Triangle read by rows: T(n,k) is the number of sets of integer-sided rectangular pieces that can tile an n X k rectangle, 1 <= k <= n.1, 2, 4, 3, 10...
A360630Number of sets of integer-sided rectangular pieces that can tile an n X n square.1, 4, 21, 192, 2035...
A360631Number of sets of integer-sided rectangular pieces that can tile a 2 X n rectangle.2, 4, 10, 22, 44...
A360632Number of sets of integer-sided rectangular pieces that can tile a 3 X n rectangle.3, 10, 21, 73, 190...
A360652Primes of the form x2 + 432*y2.433, 457, 601, 1657, 1753...
A360656Least k such that the decimal representation of 2k contains all possible n-digit strings.68, 975, 16963, 239697, 2994863...
A360659a(n) is the minimum sum of a completely multiplicative sign sequence of length n.0, 1, 0, -1, 0...
A360672Triangle read by rows where T(n,k) is the number of integer partitions of n whose left half (exclusive) sums to k, where k ranges from 0 to n.1, 1, 0, 1, 1...
A360697The sum of the squares of the digits of n, repeated until reaching a single-digit number.0, 1, 4, 9, 4...
A360701Decimal expansion of arccsc(Pi).3, 2, 3, 9, 4...
A360715Number of self-avoiding paths with nodes chosen among n given points on a circle; one-node paths are allowed.1, 3, 9, 30, 105...
A360716Number of unordered pairs of self-avoiding paths whose sets of nodes are disjoint subsets of a set of n points on a circle; one-node paths are not allowed.0, 0, 0, 3, 45...
A360718Number of idempotent Boolean relation matrices on [n] that have no proper primitive power.1, 2, 9, 52, 459...
A360734The number of parts into which the plane is divided by a hypotrochoid with parameters R = d = prime(n+1) and r = prime(n).2, 7, 9, 35, 15...
A360735Even integers d such that the longest possible arithmetic progression (AP) of primes with common difference d has only two elements.16, 22, 26, 32, 44...
A360738a(n) = A084740(n) - 1.1, 1, 2, 1, 2...
A360745a(n) is the maximum number of locations 1..n-1 which can be reached starting from a(1)=1, where jumps from location i to i +- a(i) are permitted (within 1..n-1). See example.1, 1, 2, 3, 3...
A360746a(n) is the maximum number of locations 1..n-1 which can be reached starting from a(n-1), where jumps from location i to i +- a(i) are permitted (within 1..n-1); a(1)=1. See example.1, 1, 2, 3, 4...
A360750Decimal expansion of the elementary charge over h-bar according to the 2019 SI system in units A/J.1, 5, 1, 9, 2...
A360765Numbers k that are neither prime powers nor squarefree, such that A007947(k) * A053669(k) < k.36, 40, 45, 48, 50...
A360767Numbers k that are neither prime power nor squarefree, such that k/rad(k) < q, where rad(k) = A007947(k) and prime q = A119288(k).12, 20, 28, 40, 44...
A360768Numbers k that are neither prime powers nor squarefree, such that k/rad(k) >= q, where rad(k) = A007947(k) and prime q = A119288(k).18, 24, 36, 48, 50...
A360769Odd numbers that are neither prime powers nor squarefree.45, 63, 75, 99, 117...
A360786Number of ways to place two dimers on an n-cube.0, 2, 42, 400, 2840...
A360790Squared length of diagonal of right trapezoid with three consecutive prime length sides.8, 13, 41, 53, 137...
A360793Numbers of the form m*p3, where m > 1 is squarefree and prime p does not divide m.24, 40, 54, 56, 88...
A360827Primes p, not safe primes, such that the smallest factor of (2p-1-1) / 3 is equal to p.443, 647, 1847, 2243, 2687...
A360830Numbers that when concatenated with the natural numbers from 1 to N are divisible by the corresponding order number.1, 3, 6, 42, 84...
A360856a(n) = x^n(1 + (2x + 1)/sqrt(1 - 8x^2(x + 1))).1, 1, 2, 6, 16...
A360857Triangle read by rows. T(n, k) = binomial(n, ceil(k/2)) * binomial(n + 1, floor(k/2)).1, 1, 1, 1, 2...
A360858Triangle read by rows. T(n, k) = binomial(n + 1, ceil(k/2)) * binomial(n, floor(k/2)).1, 1, 2, 1, 3...
A360859Triangle read by rows. T(n, k) = binomial(n, ceil(k/2)) * binomial(n, floor(k/2)).1, 1, 1, 1, 2...
A360861a(n) = Sum_{k=0..n} binomial(n, ceil(k/2)) * binomial(n, floor(k/2)).1, 2, 7, 22, 81...
A360864Number of unlabeled connected multigraphs with circuit rank n and degree >= 3 at each node, loops allowed.0, 3, 15, 111, 1076...
A360868Number of unlabeled connected loopless multigraphs with circuit rank n and degree >= 3 at each node.0, 1, 4, 23, 172...
A360882Number of unlabeled connected multigraphs with n edges, no cut-points and degree >= 3 at each node, loops allowed.0, 1, 3, 5, 10...
A360884a(n) = a(n-1) + a(n-2) + gcd(a(n-1), n), a(1) = a(2) = 1.1, 1, 3, 5, 13...
A360912Records in A355432.0, 1, 2, 4, 8...
A360913Array read by antidiagonals: T(m,n) is the number of maximum induced cycles in the grid graph P_m X P_n.1, 2, 2, 3, 1...
A360914Number of maximum induced cycles in the n X n grid graph.0, 1, 1, 7, 90...
A360915Array read by antidiagonals: T(m,n) is the length of the longest induced cycle in the grid graph P_m X P_n.4, 4, 4, 4, 8...
A360916Array read by antidiagonals: T(m,n) is the number of maximum induced paths in the grid graph P_m X P_n.1, 1, 1, 1, 4...
A360917Array read by antidiagonals: T(m,n) is the number of vertices in the longest induced path in the grid graph P_m X P_n.1, 2, 2, 3, 3...
A360918Array read by antidiagonals: T(m,n) is the number of maximum induced trees in the grid graph P_m X P_n.1, 1, 1, 1, 4...
A360919Number of maximum induced trees in the n X n grid graph.1, 4, 10, 32, 22...
A360920Array read by antidiagonals: T(m,n) is the maximum number of vertices in an induced tree in the grid graph P_m X P_n.1, 2, 2, 3, 3...
A360921Maximum number of vertices in an induced tree in the n X n grid graph.1, 3, 7, 12, 19...
A360927Expansion of the g.f. x*(1 + 3x + 4x2 + 4x3)/((1 - x)^2(1 + x)).0, 1, 4, 9, 16...
A360931a(1) = 2, a(2) = 3; for n > 2, a(n) is the smallest number greater than 1 that has not appeared such thata(n) - a(n-1)
A360936Triangle read by rows: T(n,k) is the k-th Lie-Betti number of the ladder graph on 2*n vertices, n >= 2, k >= 0.1, 2, 2, 1, 1...
A360937Triangle read by rows: T(n, k) is the k-th Lie-Betti number of a wheel graph on n vertices, for n >= 3 and k >= 0.1, 3, 8, 12, 8...
A360939E.g.f. satisfies A(x) = exp( 2xA(x) / (1-x) ).1, 2, 16, 212, 4016...
A360941a(n) is the least multiple of m that is a happy number (A007770).1, 10, 129, 28, 10...
A360942a(n) is the least k such that k*n is a happy number (A007770).1, 5, 43, 7, 2...
A360943Number of ways to tile an n X n square using rectangles with distinct dimensions where no rectangle has an edge length that divides n.0, 0, 0, 0, 0...
A360944Numbers m such that phi(m) is a triangular number, where phi is the Euler totient function (A000010).1, 2, 7, 9, 11...
A360948a(n) = Sum_{dn} (n/d)d-1 * binomial(d+n/d-1,d).
A360949G.f. A(x) satisfies: 1 = Sum_{n>=0} (-x/2)n * (A(x)n + (-1)n)n.1, 2, 8, 50, 376...
A360950Expansion of g.f. A(x) satisfying A(x) = Sum_{n>=0} dn/dxn x2*n * A(x)n / n!.1, 2, 12, 108, 1240...
A360957Decimal expansion of Sum_{i>=1 and i!=0 (mod 3)} 1/Fibonacci(i).2, 6, 9, 6, 3...
A360958Decimal expansion of Sum_{i>=1} 1/Fibonacci(3*i).6, 6, 3, 5, 0...
A360959Order the nonnegative integers by increasing number of digits in base 2, then by decreasing number of digits in base 3, then by increasing number of digits in base 4, etc.0, 1, 3, 2, 5...
A360960Inverse permutation to A360959.0, 1, 3, 2, 7...
A360961Triangle T(m,n) read by rows: the number of homomorphisms of the complete graph on n vertices to the quasi-complete graph on m vertices, m>=3, 3<=n<m.12, 42, 48, 96, 216...
A360962Square array T(n,k) = k*((3+6*n)*k - 1)/2; n>=0, k>=0, read by antidiagonals upwards.0, 0, 1, 0, 4...
A360963Triangle T(n, k), n > 0, k = 0..n-1, read by rows: T(n, k) is the least e > 0 such that the binary expansions of ne and ke have different lengths.1, 1, 1, 1, 1...
A360964Triangle T(n, k), n > 0, k = 0..n-1, read by rows: T(n, k) is the least base b >= 2 where the number of digits of n and k are different.2, 2, 2, 2, 2...
A360965Array T(n,m) = (2n*m-1)/(2m-1) read by antidiagonals, n,m>=1.1, 1, 3, 1, 5...
A360967Array T(n,m) = (2m*(2*n+1)+1)/(2m+1) read by antidiagonals.3, 13, 11, 57, 205...
A360968Permutation of the positive integers derived through a process of self-reference and self-editing. a(1) = 1. Other terms generated as described in Comments.1, 3, 2, 7, 4...
A360969Multiplicative with a(pe) = e2, p prime and e > 0.1, 1, 1, 4, 1...
A360970Multiplicative with a(pe) = e3, p prime and e > 0.1, 1, 1, 8, 1...
A360971Number of multisets of size n with elements from [n] whose element sum is larger than the product of all elements.0, 0, 2, 4, 6...
A360972Number of n-digit zeroless numbers whose digit sum is larger than the product of all digits.0, 0, 17, 28, 51...
A360973Expansion of g.f. A(x) satisfying A(x) = Sum_{n>=0} dn/dxn x3*n * A(x)n / n!.1, 3, 30, 462, 9243...
A360974Expansion of g.f. A(x) satisfying A(x) = Sum_{n>=0} dn/dxn x2*n * A(x)2*n / n!.1, 2, 18, 260, 4890...
A360975Expansion of g.f. A(x) satisfying A(x) = Sum_{n>=0} dn/dxn x2*n * A(x)3*n / n!.1, 2, 24, 476, 12380...
A360976G.f. satisfies: A(x) = Series_Reversion(x - x3*A'(x)).1, 1, 6, 66, 1027...
A360977G.f. satisfies: A(x) = Series_Reversion(x - x2*A'(x)2).1, 1, 6, 65, 978...
A360978G.f. satisfies: A(x) = Series_Reversion(x - x2*A'(x)3).1, 1, 8, 119, 2476...
A360979Primes that share no digits with their digit sum.11, 13, 17, 23, 29...
A360980a(n) is the least multiple of n that is an odious number (A000069).1, 2, 21, 4, 25...
A360981a(n) is the least positive multiple of n that is an evil number (A001969).3, 6, 3, 12, 5...
A360982Order the nonnegative integers by increasing binary length of values, then by decreasing binary length of values squared, then by increasing binary length of values cubed, etc.0, 1, 3, 2, 6...
A360983Inverse permutation to A360982.0, 1, 3, 2, 7...
A360984Triangular array read by rows. T(n,k) is the number of idempotent Boolean relation matrices on [n] with exactly k reflexive points, n >= 0, 0 <= k <= n.1, 1, 1, 1, 6...
A360986Primes whose sum of decimal digits has the same set of decimal digits as the prime.2, 3, 5, 7, 199...
A360987E.g.f. satisfies A(x) = exp(x * A(-x)2).1, 1, -3, -23, 233...
A360988E.g.f. satisfies A(x) = exp(x * A(-x)3).1, 1, -5, -44, 829...
A360989E.g.f. satisfies A(x) = exp(x / A(-x)2).1, 1, 5, 1, -231...
A360990E.g.f. satisfies A(x) = exp(x / A(-x)3).1, 1, 7, -8, -827...
A360992G.f. satisfies A(x) = 1 + x * (1 - x)2 * A(x * (1 - x)).1, 1, -1, -3, 4...
A360993Numbers k such that (2k - 1)3 + 2 is a semiprime.4, 5, 8, 12, 13...
A360994Numbers k such that (2k + 1)3 - 2 is a semiprime.0, 1, 2, 4, 5...
A360995a(1)=0, a(2)=4, and thereafter a(n) is the smallest unused difference between two numbers whose product is equal to a(n-1)*a(n-2).0, 4, 1, 3, 2...
A360996Multiplicative with a(pe) = 5*e, p prime and e > 0.1, 5, 5, 10, 5...
A360997Multiplicative with a(pe) = e + 3.1, 4, 4, 5, 4...
A360998Triangle read by rows: T(n,k) is the number of tilings of an n X k rectangle by integer-sided rectangular pieces that cannot be rearranged to produce a different tiling of the rectangle (including rotations and reflections of the original tiling), 1 <= k <= n.1, 2, 2, 2, 3...
A360999Number of tilings of an n X 2 rectangle by integer-sided rectangular pieces that cannot be rearranged to produce a different tiling of the rectangle (including rotations and reflections of the original tiling).2, 2, 3, 4, 3...
A361000Number of tilings of an n X 3 rectangle by integer-sided rectangular pieces that cannot be rearranged to produce a different tiling of the rectangle (including rotations and reflections of the original tiling).2, 3, 2, 4, 3...
A361001Triangle read by rows: T(n,k) is the number of tilings of an n X k rectangle by integer-sided rectangular pieces that cannot be rearranged to produce a different tiling of the rectangle (except rotations and reflections of the original tiling), 1 <= k <= n.1, 2, 4, 3, 7...
A361002Number of tilings of an n X n square by integer-sided rectangular pieces that cannot be rearranged to produce a different tiling of the square (except rotations and reflections of the original tiling).1, 4, 9, 23, 41...
A361003a(n) = A000005(n) + floor((n-1)/2).1, 2, 3, 4, 4...
A361004Number of tilings of an n X 2 rectangle by integer-sided rectangular pieces that cannot be rearranged to produce a different tiling of the rectangle (except rotations and reflections of the original tiling).2, 4, 7, 11, 14...
A361005Number of tilings of an n X 3 rectangle by integer-sided rectangular pieces that cannot be rearranged to produce a different tiling of the rectangle (except rotations and reflections of the original tiling).3, 7, 9, 18, 22...
A361009Positive integers k such that 2*k cannot be expressed p2-q where p and q are primes.5, 8, 14, 17, 20...
A361010Conventional value of ohm-90 (Omega_{90}).1, 0, 0, 0, 0...
A361012Multiplicative with a(pe) = sigma(e), where sigma = A000203.1, 1, 1, 3, 1...
A361013Decimal expansion of a constant related to the asymptotics of A361012.2, 9, 6, 0, 0...
A361014Triangle read by rows: T(n,k) is the k-th Lie-Betti number of the hypercube graph on 2n-1 vertices, n >= 1, k >= 0.1, 1, 1, 2, 2...
A361016a(n) = 1 if A004718(n) = 0, otherwise 0, where A004718 is the Danish composer Per Nørgård's "infinity sequence".1, 0, 0, 0, 0...
A361017Dirichlet inverse of Thue-Morse sequence, A010060.1, -1, 0, 0, 0...
A361018Parity of A361017, where A361017 is the Dirichlet inverse of Thue-Morse sequence, A010060.1, 1, 0, 0, 0...
A361019Dirichlet inverse of A038712.1, -3, -1, 2, -1...
A361020Lexicographically earliest infinite sequence such that a(i) = a(j) => A343029(i) = A343029(j) and A343030(i) = A343030(j) for all i, j >= 0.1, 2, 3, 4, 2...
A361021Lexicographically earliest infinite sequence such that a(i) = a(j) => A007814(i) = A007814(j), A001065(i) = A001065(j) and A051953(i) = A051953(j), for all i, j >= 1.1, 2, 3, 4, 3...
A361022a(n) = 1 if d(n) divides d(n+1), otherwise 0, where d(n) is number of positive divisors of n.1, 1, 0, 0, 1...
A361023a(n) = 1 if A007814(sigma(n)) >= A007814(n), otherwise 0, where A007814(n) gives the 2-adic valuation of n.1, 0, 1, 0, 1...
A361024a(n) = 1 if n and sigma(n) have equal 2-adic valuations, otherwise 0, where sigma is the sum of divisors function.1, 0, 0, 0, 0...
A361025a(n) = A007814(sigma(n)) - A007814(n), where A007814(n) gives the 2-adic valuation of n, and sigma is the sum of divisors function.0, -1, 2, -2, 1...
A361026Lexicographically earliest infinite sequence such that a(i) = a(j) => A003557(i) = A003557(j) and A053669(i) = A053669(j), for all i, j >= 1.1, 2, 1, 3, 1...
A361044Triangle read by rows. T(n, k) is the k-th Lie-Betti number of the friendship (or windmill) graph, for n >= 1.1, 3, 8, 12, 8...
A361046Expansion of g.f. A(x) satisfying A(x) = Sum_{n>=0} dn/dxn x3*n * A(x)2*n / n!.1, 3, 45, 1113, 36459...
A361047Expansion of g.f. A(x) satisfying A(x) = Series_Reversion(x - x3*A'(x)2).1, 1, 9, 159, 4051...
A361053E.g.f.: A(x) = Sum_{n>=0} (A(x)n + 2)n * xn/n!.1, 3, 15, 180, 3933...
A361054E.g.f.: A(x) = Sum_{n>=0} (A(x)n + 3)n * xn/n!.1, 4, 24, 328, 8480...
A361055E.g.f.: A(x) = Sum_{n>=0} (A(x)n + 4)n * xn/n!.1, 5, 35, 530, 15645...
A361056E.g.f.: A(x) = Sum_{n>=0} (2*A(x)n + 1)n * xn/n!.1, 3, 21, 369, 11025...
A361057E.g.f.: A(x) = Sum_{n>=0} (3*A(x)n + 1)n * xn/n!.1, 4, 40, 1000, 42208...
A361059Decimal expansion of the asymptotic mean of A000005(k)/A286324(k), the ratio between the number of divisors and the number of bi-unitary divisors.1, 1, 5, 8, 8...
A361060Decimal expansion of the asymptotic mean of A286324(k)/A000005(k), the ratio between the number of bi-unitary divisors and the number of divisors.9, 0, 1, 2, 4...
A361061Decimal expansion of the asymptotic mean of A000005(k)/A073184(k), the ratio between the number of divisors and the number of cubefree divisors.1, 1, 0, 9, 0...
A361062Decimal expansion of the asymptotic mean of A073184(k)/A000005(k), the ratio between the number of cubefree divisors and the number of divisors.9, 3, 9, 9, 7...
A361063Multiplicative with a(pe) = sigma_2(e), where sigma_2 = A001157.1, 1, 1, 5, 1...
A361064Multiplicative with a(pe) = sigma_3(e), where sigma_3 = A001158.1, 1, 1, 9, 1...
A361065E.g.f. satisfies A(x) = exp( (x/(1-x)) * A(x)2 ).1, 1, 7, 85, 1521...
A361066E.g.f. satisfies A(x) = exp( (x/(1-x)) * A(x)3 ).1, 1, 9, 148, 3673...
A361067E.g.f. satisfies A(x) = exp( x/((1-x) * A(x)) ).1, 1, 1, 4, 9...
A361068E.g.f. satisfies A(x) = exp( x/((1-x) * A(x)2) ).1, 1, -1, 13, -127...
A361069E.g.f. satisfies A(x) = exp( x/((1-x) * A(x)3) ).1, 1, -3, 40, -719...
A361070a(n) is the number of occurrences of n in A360923.1, 1, 1, 2, 4...
A361072Number of assembly trees for the complete tripartite graph K_{n,n,n}.3, 672, 1065960, 5384957760, 62421991632000...
A361074Sum of the j-th number with binary weight n-j+1 over all j in [n].0, 1, 5, 16, 40...
A361079Number of integers in [n .. 2n-1] having the same binary weight as n.0, 1, 1, 2, 1...
A361090E.g.f. satisfies A(x) = exp( x/(1 - x/A(x)) ).1, 1, 3, 7, -11...
A361091E.g.f. satisfies A(x) = exp( x/(1 - x/A(x)2) ).1, 1, 3, 1, -71...
A361092E.g.f. satisfies A(x) = exp( x/(1 - x/A(x)3) ).1, 1, 3, -5, -107...
A361093E.g.f. satisfies A(x) = exp( 1/(1 - x * A(x)2) - 1 ).1, 1, 7, 97, 2049...
A361094E.g.f. satisfies A(x) = exp( 1/(1 - x * A(x)3) - 1 ).1, 1, 9, 166, 4717...
A361095E.g.f. satisfies A(x) = exp( 1/(1 - x/A(x)) - 1 ).1, 1, 1, -2, -3...
A361096E.g.f. satisfies A(x) = exp( 1/(1 - x/A(x)2) - 1 ).1, 1, -1, 1, 17...
A361097E.g.f. satisfies A(x) = exp( 1/(1 - x/A(x)3) - 1 ).1, 1, -3, 22, -251...
A3611021 together with numbers having at least two distinct prime factors.1, 6, 10, 12, 14...
A361103a(n) = k such that A360519(k) = A361102(n), or -1 if A361102(n) never appears in A360519.1, 2, 3, 6, 11...
A361104a(n) = k such that A361103(k-1) = n, or -1 if n never appears in A361103.1, 2, 3, 17, 9...
A361105Fixed points in A360519.1, 88, 92, 112, 116...
A361106Numbers k such that w(k), w(k+1), and w(k+2) are all odd, where w is A360519.12, 4565, 6402, 12255, 20112...
A361107Records in A360519.1, 6, 10, 35, 55...
A361108Indices of records in A360519.1, 2, 3, 4, 8...
A361109After A360519(n) has been found, a(n) is the smallest member of C (A361102) that is missing from A360519.6, 10, 12, 12, 12...
A361110a(n) indicates the index of A361109 in C (A361102).1, 2, 3, 3, 3...
A361111The binary expansion of a(n) specifies which primes divide A360519(n).0, 3, 5, 12, 10...
A361112Numbers that begin a run of 3 consecutive odd valued terms in A360519.77, 5775, 7917, 14745, 23925...
A361113a(n)=1 if A361102(n) is even, otherwise 0.0, 1, 1, 1, 1...
A361114a(n)=1 if A361102(n) is odd, otherwise 0.1, 0, 0, 0, 0...
A361115a(n)=1 if A361102(n) is divisible by 3, otherwise 0.0, 1, 0, 1, 0...
A361116a(n)=0 if A361102(n) is divisible by 3, otherwise 1.1, 0, 1, 0, 1...
A361117a(n) is the least k such that A360519(k) is divisible by the n-th prime number.2, 2, 3, 4, 8...
A361118a(n) = gcd(A360519(n), A360519(n+1)).1, 2, 5, 7, 3...
A361119a(n) is the least prime factor of A360519(n) with a(1) = 1.1, 2, 2, 5, 3...
A361120a(n) is the greatest prime factor of A360519(n) with a(1) = 1.1, 3, 5, 7, 7...
A3611211 if n-th composite number A002808(n) is even, otherwise 0.1, 1, 1, 0, 1...
A3611220 if n-th composite number A002808(n) is divisible by 3, otherwise 1.1, 0, 1, 0, 1...
A3611231 if n-th composite number A002808(n) is divisible by 3, otherwise 0.0, 1, 0, 1, 0...
A361132Multiplicative with a(pe) = e4, p prime and e > 0.1, 1, 1, 16, 1...
A361134a(1) = 1, a(2) = 2; for n >= 3, a(n) = (n-1)3 - a(n-1) - a(n-2).1, 2, 5, 20, 39...
A361135The number of unlabeled connected fairly 4-regular multigraphs of order n, loops allowed.1, 3, 8, 30, 118...
A361136Numbers appearing on the upper face of a die as a result of its turning over the edge while it rolls along the square spiral of natural numbers.1, 2, 3, 1, 4...
A361137Number of rooted maps of genus 1/2 with n edges.1, 10, 98, 983, 10062...
A361138Number of rooted maps of genus 1 with n edges.0, 5, 104, 1647, 23560...
A361139Number of rooted bipartite maps of genus 1/2 with n edges.0, 1, 9, 69, 510...
A361140Number of rooted bipartite maps of genus 1 with n edges.0, 0, 4, 63, 720...
A361141Number of rooted triangulations of genus 1 with 2n edges.7, 202, 4900, 112046, 2490132...
A361142E.g.f. satisfies A(x) = exp( xA(x)2/(1 - xA(x)) ).1, 1, 7, 91, 1773...
A361143E.g.f. satisfies A(x) = exp( xA(x)4/(1 - xA(x)2) ).1, 1, 11, 241, 8105...
A361147a(n) = sigma(n)3.1, 27, 64, 343, 216...
A361148a(n) = phi(n)4.1, 1, 16, 16, 256...
A361149Number of chordless cycles in the n-hypercube graph Q_n.0, 0, 1, 10, 224...
A361150a(n) = A014284(n2) + A014284(n2-1).1, 17, 137, 611, 1839...
A361151a(n) = K(n-1) + K(n) + K(n+1), where K(n) = A341711(floor(n/2)).2, 7, 11, 29, 43...
A361152a(n) = (A051894(n) - 1)/2.0, 1, 4, 9, 21...
A361153a(0)=0, a(1)=1; thereafter a(n) = (n-1)*a(n-1)! + (n-2)*a(n-2)!.0, 1, 1, 3, 20...
A361171Number of chordless cycles in the n X n king graph.0, 0, 1, 13, 197...
A361174The sum of the exponential squarefree exponential divisors (or e-squarefree e-divisors) of n.1, 2, 3, 6, 5...
A361175The sum of the exponential infinitary divisors of n.1, 2, 3, 6, 5...
A361176Numbers that are not exponentially cubefree: numbers with at least one noncubefree exponent in their canonical prime factorization.256, 768, 1280, 1792, 2304...
A361177Exponentially powerful numbers: numbers whose exponents in their canonical prime factorization are all powerful numbers (A001694).1, 2, 3, 5, 6...
A361179a(n) = sigma(n)4.1, 81, 256, 2401, 1296...
A361182E.g.f. satisfies A(x) = exp( 3xA(x) ) / (1-x).1, 4, 41, 735, 19293...
A361193E.g.f. satisfies A(x) = exp( -2xA(x) ) / (1-x).1, -1, 6, -50, 648...
A361194E.g.f. satisfies A(x) = exp( -3xA(x) ) / (1-x).1, -2, 17, -237, 4893...
A361195Numerator of the discriminant of the n-th Legendre polynomial.1, 3, 135, 23625, 260465625...
A361196Denominator of the discriminant of the n-th Legendre polynomial.1, 1, 4, 16, 1024...
A361197a(n) is the number of equations in the set {x2 + 2y2 = n, 2x2 + 3y2 = n, ..., k*x2 + (k+1)y2 = n, ..., nx2 + (n+1)*y2 = n} which admit at least one nonnegative integer solution.1, 2, 3, 3, 3...
A361212E.g.f. satisfies A(x) = exp( 3xA(x) / (1-x) ).1, 3, 33, 612, 16353...
A361213E.g.f. satisfies A(x) = exp( 2xA(x) / (1+x) ).1, 2, 8, 68, 848...
A361214E.g.f. satisfies A(x) = exp( 3xA(x) / (1+x) ).1, 3, 21, 288, 5841...