r/OEIS • • Aug 26 '22

Meta Unrestricting the subreddit, new guidelines

25 Upvotes

Hello everyone!

I recently took over this subreddit with the aim of hopefully bringing it to life to some degree. I love the OEIS and the vital function it serves for the broader mathematical community. With that in mind, the sub has exited Restricted mode so anyone can post without moderator approval.

This subreddit is intended for discussion of the OEIS, its role, its function, and its contents. It may also be used to discuss meta-concerns (such as the most recent post regarding the nature of OEIS editors) and integer sequences as a whole even if they are not considered of interest to the OEIS itself. For now, just take a look at the available flair for new posts and use that as a guide. There's an "Other" flair in case there's anything I missed!

If you have any ideas or suggestions for the direction of this sub, feel free to reach out via modmail and let me know. I am *not* currently seeking additional moderators, but if this sub is able to grow into something bigger, I won't hesitate to bring on some sub veterans to help manage the community.

Thanks in advance for bringing your love of mathematics to this budding community!


r/OEIS • • Jan 07 '21

I was just accepted: A340265

23 Upvotes

a(n) = n + 1 - a(phi(n))

I can't believe no one has thought of this simple, provably bounded recurrence before.


r/OEIS • • Aug 27 '22

Cool OEIS graphs pt 1

Post image
21 Upvotes

r/OEIS • • Apr 04 '23

Me introducting a friend to OEIS

Post image
17 Upvotes

and yes oeis did have it :)


r/OEIS • • Mar 22 '21

Has anyone else been put off by the abrasive attitudes of OEIS editors?

17 Upvotes

I have tried to contribute to OEIS multiple times, but the reviewers have consistently been rude and not constructive. I'm constantly told what I have done wrong, but never told how to correct it. When I ask how to correct it, I am told either nothing or it is implied that it is not correctable.

I thought it would be similar to Wikipedia, but the toxicity of the community on Wikipedia (which now seems minimal in comparison) is amplified 100 fold on OEIS.


r/OEIS • • Feb 11 '23

A002522

Post image
16 Upvotes

r/OEIS • • Sep 19 '22

New OEIS sequences - week of 09/18

16 Upvotes
OEIS numberDescriptionSequence
A345747a(n) = n! * Sum_{k=0..floor(n/2)} kn - 2*k/k!.1, 0, 2, 6, 36, 240, 2280, 27720...
A354522Square array A(n, k), n, k >= 0, read by antidiagonals; A(n, k) = g(f(n) + f(k)) where f denotes A001057 and g denotes its inverse.0, 1, 1, 2, 3, 2, 3, 0...
A355476a(1)=1. For a(n) a novel term, a(n+1) = A000005(a(n)). For a(n) seen already k > 1 times, a(n+1) = k*a(n).1, 1, 2, 2, 4, 3, 2, 6...
A355575a(n) = n! * Sum_{k=0..floor(n/3)} kn - 3*k/k!.1, 0, 0, 6, 24, 120, 1080, 10080...
A355848Irregular triangle read by rows in which row n lists the numbers whose divisors have arithmetic mean n, or 0 if no such number exists.1, 3, 5, 6, 7, 0, 11, 14...
A355850Number of monotonic lattice paths of length n which do not pass above the line y = x/(log_2(3)-1).1, 1, 2, 3, 6, 12, 22, 44...
A355856Primes, with at least one prime digit, that remain primes when all of their prime digits are removed.113, 131, 139, 151, 179, 193, 197, 211...
A355903Variant of Stepping Stones problem: here the stone you place only needs to divide the sum of its 8 neighbors.1, 27, 41, 67
A355904Negasemiternary (or NST) representation of n.0, 1, 2, 210, 211, 212, 21120, 21121...
A355905Left-most path in the tree T_0 of all negasemiternary (or NST) fractions whose 2-adic part is zero.0, 2, 1, 1, 0, 1, 1, 1...
A355906a(0) = 0; for n >= 1, a(n) = -(3/2)*(a(n-1)+A355905(n-1)).0, 0, -3, 3, -6, 9, -15, 21...
A355907A355906(n)/3.0, 0, -1, 1, -2, 3, -5, 7...
A355908A335905(n) + A335906(n).0, 2, -2, 4, -6, 10, -14, 22...
A355909Number of nodes at level n in the tree T_0 mentioned in A355905.1, 2, 3, 4, 6, 9, 13, 19...
A355910Number of nodes at level n in the tree T_{-2}.1, 1, 1, 2, 3, 4, 6, 9...
A355911Number of alt-unary-binary trees with n nodes.1, 1, 2, 2, 2, 4, 4, 4...
A355912Negasemiternary (or NST) representation of the unit ambinumber (0,1).1, 2, 1, 1, 2, 2, 0, 0...
A355913Negasemiternary (or NST) representation of the unit ambinumber (1,0).2, 1, 1, 2, 0, 1, 0, 2...
A355920Largest prime number p such that xn + yn mod p does not take all values on Z/pZ.7, 29, 61, 223, 127, 761, 307, 911...
A356034Decimal expansion of the real root of x3 - x2 - 3.1, 8, 6, 3, 7, 0, 6, 5...
A356184Triangle read by rows: n-th row gives the indices of the n repunits that divide A340549(n).1, 1, 2, 1, 2, 4, 1, 2...
A356252The smallest number of straight lines that can be used to draw n non-overlapping pentagonal stars.5, 8, 9, 11, 12, 13
A356294a(n) = A054633(n) if A030190(n) = 1, else a(n) = a(n-A054633(n)+1).1, 2, 1, 3, 4, 5, 2, 1...
A356320Length of the common prefix in binary expansions of n and A332221(n) = A156552(sigma(A005940(1+n))).0, 1, 1, 1, 2, 3, 1, 1...
A356404The number of closed routes of the chess knight, different in shape, consisting of 2 * n jumps on a checkered field without repeating cells of the route.1, 3, 25, 480, 11997, 350275, 10780478
A356498Primes p such that 100*p + 11 is also prime.2, 3, 23, 41, 83, 101, 107, 113...
A356592Array A(n, k), n, k >= 0, read by antidiagonals; A(n, k) = Sum_{i, j >= 3} t_i * u_j * T(i+j) where Sum_{i >= 3} t_i * T(i) and Sum_{j >= 3} u_j * T(j) are the greedy tribonacci representations of n and k, respectively, and T = A000073.0, 0, 0, 0, 7, 0, 0, 13...
A356639Number of integer sequences b with b(1) = 1, b(m) > 0 and b(m+1) - b(m) > 0, of length n which transform under the map S into a nonnegative integer sequence. The transform c = S(b) is defined by c(m) = Product_{k=1..m} b(k) / Product_{k=2..m}( b(k)-b(k-1)).1, 1, 3, 17, 155, 2677, 73327, 3578339...
A356783Coefficients in the power series A(x) such that: 1 = Sum_{n=-oo..+oo} x2*n+1 * (1 - xn)n+1 * A(x)n.1, 1, 2, 6, 17, 50, 163, 525...
A356834a(n) = n! * Sum_{k=0..floor(n/2)} (n - 2k)n/(n - 2k)!.1, 1, 4, 33, 448, 8105, 192576, 5946913...
A356870a(n) = (A005132(2n-1) + A005132(2n))/4.1, 2, 5, 8, 8, 8, 8, 8...
A356901a(n) = (2n)! * [x^(2n)] arctan(x / sqrt(2))2.0, 1, -4, 46, -1056, 40536, -2342880, 190229040...
A356930Numbers whose prime indices have all odd prime indices. MM-numbers of finite multisets of finite multisets of odd numbers.1, 2, 3, 4, 6, 7, 8, 9...
A356931Number of multiset partitions of the prime indices of n into multisets of odd numbers. Number of factorizations of n into members of A066208.1, 1, 0, 2, 1, 0, 0, 3...
A356932Number of multiset partitions of integer partitions of n such that all blocks have odd size.1, 1, 2, 4, 7, 13, 24, 42...
A356935Numbers whose prime indices all have odd bigomega (number of prime factors with multiplicity). Products of primes indexed by elements of A026424. MM-numbers of finite multisets of finite odd-length multisets of positive integers.1, 3, 5, 9, 11, 15, 17, 19...
A356939MM-numbers of multisets of intervals. Products of primes indexed by members of A073485.1, 2, 3, 4, 5, 6, 8, 9...
A356940MM-numbers of multisets of initial intervals. Products of elements of A062447 (primes indexed by primorials A002110).1, 2, 3, 4, 6, 8, 9, 12...
A356941Number of multiset partitions of integer partitions of n such that all blocks are gapless.1, 1, 3, 6, 13, 24, 49, 88...
A356944MM-numbers of multisets of gapless multisets of positive integers. Products of primes indexed by elements of A073491.1, 2, 3, 4, 5, 6, 7, 8...
A356946Number of stable digits of the integer tetration nn (i.e., maximum nonnegative integer m such that nn is congruent modulo 10m to n^(n + 1)).1, 0, 2, 3, 12, 7, 12, 7...
A356953Least nonzero starting number in the first run of exactly n consecutive numbers having the same number of prime factors counted with multiplicity, or -1 if no such number exists.1, 2, 33, 1083, 602, 2522, 211673, 6612470...
A356954Number of multisets of multisets, each covering an initial interval, whose multiset union is of size n and has weakly decreasing multiplicities.1, 1, 3, 6, 15, 30, 71, 145...
A356955MM-numbers of multisets of multisets, each covering an initial interval. Products of primes indexed by elements of A055932.1, 2, 3, 4, 6, 7, 8, 9...
A356957Number of set partitions of strict integer partitions of n into intervals, where an interval is a set of positive integers with all differences of adjacent elements equal to 1.1, 1, 1, 3, 2, 4, 7, 7...
A356980Numbers k such that prime(k) can be written using only the digits of k (but they may used multiple times).137, 187, 321, 917, 1098, 1346, 1347, 1349...
A356981Numbers k such that the sum of distinct digits of k equals the sum of the prime divisors of k.2, 3, 5, 7, 84, 144, 160, 250...
A357000Number of non-isomorphic cyclic Haar graphs on 2*n nodes.1, 2, 3, 5, 5, 12, 9, 22...
A357001a(n) = A002729(n)-A357000(n)-1.0, 0, 0, 0, 0, 0, 0, 1...
A357002Numbers k such that A357001(k) > 0.8, 16, 18, 24, 25, 27
A357003Number of Hamiltonian cycles in the cyclic Haar graph with index n.0, 0, 1, 0, 1, 1, 6, 0...
A357004Smallest k for which the cyclic Haar graphs with indices k and n are isomorphic.1, 2, 3, 4, 5, 5, 7, 8...
A357005Smallest k that is cyclically equivalent (see Comment for definition) to n.1, 2, 3, 4, 5, 5, 7, 8...
A357006Numbers k that are the smallest of all numbers that are cyclically equivalent to k.1, 2, 3, 4, 5, 7, 8, 9...
A357019a(n) is the largest possible x in n = x2 - x*y + y2 with integers x > y >= 0, or 0 if n cannot be expressed in this form.0, 1, 0, 2, 2, 0, 0, 3...
A357039Number of integer solutions to x' = 2n, where x' is the arithmetic derivative of x.0, 1, 1, 1, 2, 2, 2, 3...
A357040Deficient composite numbers whose sum of aliquot divisors as well as product of aliquot divisors is a perfect square.75, 76, 124, 147, 153, 243, 332, 363...
A357044Lexicographic earliest sequence of distinct palindromes (A002113) such that a(n)+a(n+1) is never palindromic.1, 9, 3, 7, 5, 8, 2, 11...
A357045Lexicographically earliest sequence of distinct non-palindromic numbers (A029742) such that a(n)+a(n+1) is always a palindrome (A002113).10, 12, 21, 23, 32, 34, 43, 45...
A357052Distance from 10n to the next prime triplet.4, 1, 1, 87, 267, 357, 33, 451...
A357058Number of regions in a square when n internal squares are drawn between the 4n points that divide each side into n+1 equal parts.1, 5, 17, 37, 65, 93, 145, 181...
A357060Number of vertices in a square when n internal squares are drawn between the 4n points that divide each side into n+1 equal parts.4, 8, 20, 40, 68, 88, 148, 168...
A357061Number of edges in a square when n internal squares are drawn between the 4n points that divide each side into n+1 equal parts.4, 12, 36, 76, 132, 180, 292, 348...
A357074Numbers sandwiched between a pair of numbers each with exactly two prime factors (counted without multiplicity).11, 13, 19, 21, 23, 25, 27, 34...
A357077The lesser of two consecutive numbers with at least 3 prime factors (counted with multiplicity).27, 44, 63, 75, 80, 98, 99, 104...
A357078Triangle read by rows. The partition transform of A355488, which are the alternating row sums of the number of permutations of [n] with k components (A059438).1, 0, 1, 0, 0, 1, 0, 2...
A357079Triangle read by rows. T(n, k) = A356265(n, k) + A357078(n, k) for 0 <= k <= n.1, 0, 1, 0, 1, 1, 0, 3...
A357082a(0) = 0; for n > 0, a(n) is the smallest positive number not previously occurring such that the binary string of a(n-1) + a(n) does not appear in the binary string concatenation of a(0)..a(n-1).0, 1, 2, 3, 4, 5, 10, 6...
A357083a(n) is the number of free polycubes of size n with holes.11, 215, 3173, 38564
A357096Least number whose set of decimal digits coincides with the set of decimal digits of prime(n).2, 3, 5, 7, 1, 13, 17, 19...
A357100Decimal expansion of the real root of x3 + x2 - 3.1, 1, 7, 4, 5, 5, 9, 4...
A357111For n >= 1, a(n) = n / A076775(n).1, 1, 3, 1, 5, 3, 7, 1...
A357112a(n) = A035019(n)/6 for n > 0.1, 1, 1, 2, 1, 1, 2, 1...
A357113T(n,m) is the numerator of the resistance between two diametrically opposite nodes of a rectangular electric network of n*m quadratic meshes in which all edges are replaced by one-ohm resistors, where T(n,m) is a triangle read by rows.1, 7, 3, 15, 121, 13, 45, 430...
A357114T(n,m) is the denominator of the resistance between two diametrically opposite nodes of a rectangular electric network of n*m quadratic meshes in which all edges are replaced by one-ohm resistors, where T(n,m) is a triangle read by rows.1, 5, 2, 8, 69, 7, 19, 209...
A357115T(n,m) is the numerator of the resistance between two nodes located at the end of a side of length n of a rectangular electric network of n*m quadratic meshes in which all edges are replaced by one-ohm resistors, where T(n,m) is a square array read by descending antidiagonals.3, 11, 4, 41, 5, 13, 153, 26...
A357116T(n,m) is the denominator of the resistance between two nodes located at the end of a side of length n of a rectangular electric network of n*m quadratic meshes in which all edges are replaced by one-ohm resistors, where T(n,m) is a square array read by descending antidiagonals.4, 15, 3, 56, 4, 7, 209, 21...
A357120Irregular triangle T(n, k), n > 0, k = 1..A278043(n); the n-th row contains, in ascending order, the terms in the greedy tribonacci representation of n.1, 2, 1, 2, 4, 1, 4, 2...
A357121Irregular triangle T(n, k), n > 0, k = 1..A352104(n); the n-th row contains, in ascending order, the terms in the lazy tribonacci representation of n.1, 2, 1, 2, 4, 1, 4, 2...
A357125Positive integers n such that 2n-3 == -1 (mod n).1, 5, 4553, 46777, 82505, 4290773, 4492205, 4976429...
A357130a(n) = 2n - (-1)^n(1+(n mod 2)).4, 3, 8, 7, 12, 11, 16, 15...
A357132Numbers k such that the product of distinct digits of k equals the product of the prime divisors of k.1, 2, 3, 5, 6, 7, 135, 175...
A357140Number of n X n triangular (0,1)-matrices with exactly 2n entries equal to 1 and no zero rows or columns.1, 0, 0, 1, 26, 865, 39268, 2375965...
A357141Number of n X n triangular matrices with nonnegative integer entries and without zero rows or columns such that sum of all entries is equal to 2n.1, 1, 6, 71, 1433, 44443, 1968580, 118159971...
A357144Square array, A(n, k), n, k >= 0, read by antidiagonals; A(n, k) = g(f(n) * f(k)) where f(m) = A002487(m)/A002487(m+1) and g is the inverse of f.0, 0, 0, 0, 1, 0, 0, 2...
A357146a(n) = n! * Sum_{k=0..floor(n/2)} (n - 2k)^(2k)/(n - 2*k)!.1, 1, 1, 7, 49, 301, 6241, 74131...
A357147a(n) = n! * Sum_{k=0..floor(n/3)} (n - 3k)^(3k)/(n - 3*k)!.1, 1, 1, 1, 25, 481, 3241, 18481...
A357148a(n) = A357082(n-1) + A357082(n).1, 3, 5, 7, 9, 15, 16, 15...
A357149a(n) = smallest missing number in A357082(k) for k = 0..n.1, 2, 3, 4, 5, 6, 6, 7...
A357151Coefficients in the power series A(x) such that: A(x) = Sum_{n=-oo..+oo} x2*n+1 * (1 - xn)n+1 * A(x)n.1, 1, 3, 13, 60, 299, 1586, 8697...
A357152Coefficients in the power series A(x) such that: A(x)2 = Sum_{n=-oo..+oo} x2*n+1 * (1 - xn)n+1 * A(x)n.1, 1, 4, 23, 147, 1022, 7529, 57605...
A357153Coefficients in the power series A(x) such that: A(x)3 = Sum_{n=-oo..+oo} x2*n+1 * (1 - xn)n+1 * A(x)n.1, 1, 5, 36, 294, 2619, 24707, 242371...
A357154Coefficients in the power series A(x) such that: A(x)4 = Sum_{n=-oo..+oo} x2*n+1 * (1 - xn)n+1 * A(x)n.1, 1, 6, 52, 517, 5615, 64587, 772961...
A357155Coefficients in the power series A(x) such that: A(x)5 = Sum_{n=-oo..+oo} x2*n+1 * (1 - xn)n+1 * A(x)n.1, 1, 7, 71, 832, 10660, 144684, 2043814...
A357160Coefficients in the power series A(x) such that: 1 = Sum_{n=-oo..+oo} x3*n+2 * (1 - xn-1)n+1 * A(x)n.1, 1, 2, 8, 24, 88, 313, 1187...
A357161Coefficients in the power series A(x) such that: A(x) = Sum_{n=-oo..+oo} x3*n+2 * (1 - xn-1)n+1 * A(x)n.1, 1, 3, 15, 71, 378, 2087, 12006...
A357162Coefficients in the power series A(x) such that: A(x)2 = Sum_{n=-oo..+oo} x3*n+2 * (1 - xn-1)n+1 * A(x)n.1, 1, 4, 25, 162, 1160, 8731, 68364...
A357163Coefficients in the power series A(x) such that: A(x)3 = Sum_{n=-oo..+oo} x3*n+2 * (1 - xn-1)n+1 * A(x)n.1, 1, 5, 38, 313, 2834, 27088, 269380...
A357164Coefficients in the power series A(x) such that: A(x)4 = Sum_{n=-oo..+oo} x3*n+2 * (1 - xn-1)n+1 * A(x)n.1, 1, 6, 54, 540, 5925, 68753, 830267...
A357165Coefficients in the power series A(x) such that: A(x)5 = Sum_{n=-oo..+oo} x3*n+2 * (1 - xn-1)n+1 * A(x)n.1, 1, 7, 73, 859, 11083, 151369, 2151961...
A357166If n appears in A357082, then a(n) is the unique k such that A357082(k) = n; otherwise a(n) = -1.0, 1, 2, 3, 4, 5, 7, 9...
A357167Numbers k such that k and k+2 are both odd numbers whose prime factors are all prime-indexed primes.1, 3, 9, 15, 25, 31, 81, 83...
A357168Starts of runs of at least 3 consecutive odd numbers whose prime factors are all prime-indexed primes.1, 81, 121, 123, 153, 275, 1199, 1201...
A357169Starts of runs of at least 4 consecutive odd numbers whose prime factors are all prime-indexed primes.121, 1199, 1409, 16141, 56699, 474529, 695235, 1780713...
A357171a(n) is the number of divisors of n whose digits are in strictly increasing order (A009993).1, 2, 2, 3, 2, 4, 2, 4...
A357172a(n) is the smallest integer that has exactly n divisors whose decimal digits are in strictly increasing order.1, 2, 4, 6, 16, 12, 54, 24...
A357173Positions of records in A357171, i.e., integers whose number of divisors whose decimal digits are in strictly increasing order sets a new record.1, 2, 4, 6, 12, 24, 36, 48...
A357174a(n) = n! * Sum_{k=0..floor(n/3)} (n - 3k)n/(n - 3k)!.1, 1, 4, 27, 280, 5045, 134136, 4269223...
A357177Prime indices of the Heegner numbers (A003173).0, 1, 2, 4, 5, 8, 14, 19...
A357191a(n) = n! * Sum_{k=0..floor(n/2)} kn/k!.1, 0, 2, 6, 216, 2040, 111240, 2164680...
A357192a(n) = n! * Sum_{k=0..floor(n/3)} kn/k!.1, 0, 0, 6, 24, 120, 23760, 327600...
A357193a(n) = n! * Sum_{k=0..floor(n/2)} k2*n/k!.1, 0, 2, 6, 3096, 61560, 65248200, 4058986680...
A357194a(n) = n! * Sum_{k=0..floor(n/3)} k3*n/k!.1, 0, 0, 6, 24, 120, 94372560, 5284828080...
A357196Number of regions in a hexagon when n internal hexagons are drawn between the 6n points that divide each side into n+1 equal parts.1, 7, 25, 55, 97, 151, 217, 295...
A357197Number of vertices in a hexagon when n internal hexagons are drawn between the 6n points that divide each side into n+1 equal parts.6, 12, 30, 60, 102, 156, 222, 300...
A357198Number of edges in a hexagon when n internal hexagons are drawn between the 6n points that divide each side into n+1 equal parts.6, 18, 54, 114, 198, 306, 438, 594...
A357200Coefficients in the power series A(x) such that: 1 = Sum_{n=-oo..+oo} xn * (1 - xn+1)n+1 * A(x)n.1, 1, 0, 0, -7, -3, -17, 52...
A357201Coefficients in the power series A(x) such that: A(x) = Sum_{n=-oo..+oo} xn * (1 - xn+1)n+1 * A(x)n.1, 1, 1, 3, 1, 5, -26, -75...
A357202Coefficients in the power series A(x) such that: A(x)2 = Sum_{n=-oo..+oo} xn * (1 - xn+1)n+1 * A(x)n.1, 1, 2, 9, 35, 182, 921, 5062...
A357203Coefficients in the power series A(x) such that: A(x)3 = Sum_{n=-oo..+oo} xn * (1 - xn+1)n+1 * A(x)n.1, 1, 3, 18, 111, 800, 5990, 46995...
A357204Coefficients in the power series A(x) such that: A(x)4 = Sum_{n=-oo..+oo} xn * (1 - xn+1)n+1 * A(x)n.1, 1, 4, 30, 245, 2256, 21849, 220655...
A357205Coefficients in the power series A(x) such that: A(x)5 = Sum_{n=-oo..+oo} xn * (1 - xn+1)n+1 * A(x)n.1, 1, 5, 45, 453, 5072, 59964, 738449...
A357212a(n) = number of nonempty subsets of {1,2,...,n} having a partition into two subsets with the same sum of elements.0, 0, 1, 3, 7, 17, 37, 81...
A357217Array read by descending antidiagonals: T(n,k) is the number of cycles of the permutation given by the order of elimination in the Josephus problem for n numbers and a count of k; n, k >= 1.1, 1, 2, 1, 1, 3, 1, 2...

r/OEIS • • Sep 11 '22

New OEIS sequences - week of 09/11

15 Upvotes

Hello! This bot, u/OEIS-Tracker, will make a post every Sunday and present newly-added sequences for your viewing pleasure. These posts will not be pinned. Enjoy!

A357086: E.g.f. satisfies A(x) * log(A(x)) = (exp(x*A(x)) - 1)2. 1, 0, 2, 6, 50, 510, 5882, 88326, 1502258, 29368590...

A357087: E.g.f. satisfies A(x) * log(A(x)) = (exp(x*A(x)) - 1)3. 1, 0, 0, 6, 36, 150, 2340, 47166, 676116, 10602150...

A357088: E.g.f. satisfies A(x) * log(A(x)) = (exp(x*A(x)) - 1)2 / 2. 1, 0, 1, 3, 16, 135, 1246, 14238, 192613, 2948025...

A357089: E.g.f. satisfies A(x) * log(A(x)) = (exp(x*A(x)) - 1)3 / 6. 1, 0, 0, 1, 6, 25, 140, 1561, 19586, 228425...

A357090: E.g.f. satisfies A(x) = (1 - x * A(x))log(1 - x * A(x) * A(x)). 1, 0, 2, 6, 106, 1060, 21728, 396648, 10174764, 267855264...

A357091: E.g.f. satisfies A(x) = 1/(1 - x * A(x))log(1 - x * A(x)2 * A(x)). 1, 0, 0, 6, 36, 210, 4590, 85344, 1353912, 30525384...

A357092: E.g.f. satisfies A(x)A(x) = (1 - x * A(x))log(1 - x * A(x)). 1, 0, 2, 6, 58, 580, 7568, 119448, 2195772, 46413792...

A357093: E.g.f. satisfies A(x)A(x) = 1/(1 - x * A(x))log(1 - x * A(x)2). 1, 0, 0, 6, 36, 210, 3150, 55104, 890232, 16735944...

A357094: E.g.f. satisfies A(x)A(x) = (1 - x * A(x))log(1 - x * A(x) / 2). 1, 0, 1, 3, 20, 170, 1789, 22869, 342222, 5874840...

A357095: E.g.f. satisfies A(x)A(x) = 1/(1 - x * A(x))log(1 - x * A(x)2 / 6). 1, 0, 0, 1, 6, 35, 275, 2884, 35672, 494724...

A357043: Lexicographically earliest infinite sequence of distinct nonnegative integers such that neither a(n) nor a(n+1) share a digit with (a(n)+a(n+1))/2. 0, 1, 3, 5, 7, 2, 4, 6, 8, 10...

A357054: Decimal expansion of Sum_{k>=1} (-1)k+1k/Fibonacci(2k). 5, 8, 0, 0, 0, 4, 7, 3, 9, 5...

A357073: For n >= 1, a(n) = A003714(n) mod n. 0, 0, 1, 1, 3, 3, 3, 0, 8, 8...

A357084: E.g.f. satisfies log(A(x)) = (exp(x*A(x)) - 1)2 * A(x). 1, 0, 2, 6, 98, 990, 19082, 347046, 8512226, 220737390...

A357085: E.g.f. satisfies log(A(x)) = (exp(x*A(x)) - 1)3 * A(x). 1, 0, 0, 6, 36, 150, 3780, 77406, 1059156, 21669990...

A357020: a(n) is the start of the first run of exactly n consecutive numbers not of the form x2 + x*y + y2. 2, 5, 22, 32, 68, 85, 230, 260, 352, 1901...

A357007: Number of vertices in an equilateral triangle when n internal equilateral triangles are drawn between the 3n points that divide each side into n+1 equal parts. 3, 6, 15, 30, 51, 66, 111, 150, 171, 246...

A357008: Number of edges in an equilateral triangle when n internal equilateral triangles are drawn between the 3n points that divide each side into n+1 equal parts. 3, 9, 27, 57, 99, 135, 219, 297, 351, 489...

A356966: Numbers with no common terms in their greedy and lazy tribonacci representations. 0, 7, 13, 24, 44, 81, 88, 149, 156, 162...

A356969: A(n, k) is the sum of the terms in common in the dual Zeckendorf representations of n and of k; square array A(n, k) read by antidiagonals, n, k >= 0. 0, 0, 0, 0, 1, 0, 0, 0, 0, 0...

A356974: Irregular triangle T(n, k) read by rows, n >= 0, k = 1..A117546(n); the n-th row contains the numbers m such that A356964(m) = n, in increasing order. 0, 1, 2, 3, 4, 5, 6, 7, 8, 9...

A356982: Fixed point of the morphism 0->010, 1->000. 0, 1, 0, 0, 0, 0, 0, 1, 0, 0...

A356984: Number of regions in an equilateral triangle when n internal equilateral triangles are drawn between the 3n points that divide each side into n+1 equal parts. 1, 4, 13, 28, 49, 70, 109, 148, 181, 244...

A356985: Numbers k that divide the concatenation of sigma(k-1) and sigma(k+1). 2, 55, 56, 93, 170, 944, 1904, 2839, 3104, 4213...

A356937: Number of multisets of intervals whose multiset union is of size n and covers an initial interval of positive integers. 1, 1, 3, 9, 29, 94, 310, 1026, 3411, 11360...

A356938: Number of multisets of intervals whose multiset union is of size n and covers an initial interval of positive integers with weakly decreasing multiplicities. 1, 1, 3, 7, 18, 41, 101, 228, 538, 1209...

A356943: Number of multiset partitions into gapless blocks of a size-n multiset covering an initial interval with weakly decreasing multiplicities. 1, 1, 4, 11, 37, 101, 328, 909, 2801

A356945: Number of multiset partitions of the prime indices of n such that each block covers an initial interval. Number of factorizations of n into members of A055932. 1, 1, 0, 2, 0, 1, 0, 3, 0, 0...

A356964: Replace 2k in binary expansion of n with tribonacci(k+3) (where tribonacci corresponds to A000073). 0, 1, 2, 3, 4, 5, 6, 7, 7, 8...

A356965: a(n) is the sum of the tribonacci numbers in common in the greedy and lazy tribonacci representations of n. 0, 1, 2, 3, 4, 5, 6, 0, 8, 9...

A356888: a(n) = ((n-1)2 + 2)*2n-2. 1, 3, 12, 44, 144, 432, 1216, 3264, 8448, 21248...

A356889: a(n) = (n2 + 3*n + 10/3)*4n-3 - 1/3. 3, 21, 125, 693, 3669, 18773, 93525, 456021, 2184533, 10310997...

A356933: Number of multisets of multisets, each of odd size, whose multiset union is a size-n multiset covering an initial interval. 1, 1, 2, 8, 28, 108, 524, 2608, 14176

A356934: Number of multisets of odd-size multisets whose multiset union is a size-n multiset covering an initial interval with weakly decreasing multiplicities. 1, 1, 2, 6, 17, 46, 166, 553, 2093

A356726: Integers which have in Roman numerals more distinct symbols than any smaller number. 1, 4, 14, 44, 144, 444, 1444

A356729: Numbers having at least 4 distinct partitions into exactly 3 parts with the same product. 118, 130, 133, 135, 137, 140, 148, 149, 153, 155...

A356658: The number of orderings of the hypercube Q_n whose disorder number is equal to the disorder number of Q_n. 2, 8, 48, 2304, 4024320

A356294: a(n) = A054633(n) if A030190(n) = 1, else a(n) = a(n-A054633(n)+1). 1, 2, 1, 3, 4, 5, 2, 1, 6, 3...

A356421: Positive integers k such that k + p is a power of 2, where p is the least prime greater than k. 3, 15, 61, 255, 2043, 4093, 32765, 65535, 262141, 8388599...

A355551: Number of ways to select 3 or more collinear points from a 3 X n grid. 1, 2, 8, 23, 61, 144, 322, 689, 1439, 2954...

A355617: a(1) = 1; a(2) = 2; for n > 2, a(n) = R(a(n-1)) if a(n-1) != R(a(n-2)) and R(a(n-1)) has not yet been used, where R is the digit reversal function A004086, otherwise a(n) is the smallest positive integer > a(n-1) that has not yet been used. 1, 2, 3, 4, 5, 6, 7, 8, 9, 10...

A355667: Least number phi(k) such that n * phi(k) < k, where phi is Euler's totient function. 1, 2, 8, 48, 5760, 36495360, 1854081073152000, 400440702414394285778534400000, 165062110921422523175104166476600499887194872217600000000

A354529: a(1) = 3, a(2) = 12 and a(n) = (3n2+8n-2)/2 if n is even or = (3n2+8n-5)/2, if n is odd, for n >= 3. 3, 12, 23, 39, 55, 77, 99, 127, 155, 189...

A355276: Number of n-digit terms in A347475. 2, 2, 1, 4, 4, 6, 3, 8, 9, 12...

A355278: Lower left of the Cayley table for the primes when made into a group using the bijection (2, 3, 5, 7, ...) -> (0, +1, -1, +2, ...) into (Z, +); read by rows. 2, 3, 7, 5, 2, 11, 7, 13, 3, 19...

A354496: Number of left-sided quantales on n elements, up to isomorphism. Also number of right-sided quantales on n elements, up to isomorphism. 1, 2, 9, 60, 497, 4968, 58507, 807338, 13341730

A354497: Number of strictly left-sided quantales on n elements, up to isomorphism. Also number of strictly right-sided quantales on n elements, up to isomorphism. 1, 1, 4, 23, 164, 1482, 15838, 197262, 2830649

A354498: Number of two-sided quantales on n elements, up to isomorphism. 1, 2, 8, 47, 354, 3277, 36506, 490983, 8301353

A356815: Expansion of e.g.f. exp(-x * (exp(2*x) + 1)). 1, -2, 0, 4, 32, 48, -608, -6400, -24064, 163072...

A356816: Expansion of e.g.f. exp(-x * (exp(3*x) + 1)). 1, -2, -2, 1, 88, 583, 676, -35597, -519392, -3359393...

A356180: a(n) = A022838(A001951(n)). 1, 3, 6, 8, 12, 13, 15, 19, 20, 24...

A356233: Number of integer factorizations of n into gapless numbers (A066311). 1, 1, 1, 2, 1, 2, 1, 3, 2, 1...

A356069: Number of divisors of n whose prime indices cover an interval of positive integers (A073491). 1, 2, 2, 3, 2, 4, 2, 4, 3, 3...

A356603: Position in A356226 of first appearance of the n-th composition in standard order (row n of A066099). 1, 2, 4, 10, 8, 20, 50, 110, 16, 40...

A356234: Irregular triangle read by rows where row n is the ordered factorization of n into maximal gapless divisors. 2, 3, 4, 5, 6, 7, 8, 9, 2, 5...

A356841: Numbers k such that the k-th composition in standard order covers an interval of positive integers (gapless). 0, 1, 2, 3, 4, 5, 6, 7, 8, 10...

A355898: a(1) = a(2) = 1; a(n) = gcd(a(n-1), a(n-2)) + (a(n-1) + a(n-2))/gcd(a(n-1), a(n-2)). 1, 1, 3, 5, 9, 15, 11, 27, 39, 25...


r/OEIS • • Aug 27 '22

Parity Bitmaps from the OEIS

Thumbnail
blog.peterkagey.com
15 Upvotes

r/OEIS • • Sep 05 '22

My Favorite Sequences: A261865

Thumbnail
blog.peterkagey.com
14 Upvotes

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 • • 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 • • Sep 10 '22

Meta Should there be a weekly post of some kind?

12 Upvotes

I would like to provide some consistent OEIS content, probably in the form of a pinned post. If something were to be added, what sort of thing would you like to see?

Or, do you think that an inorganic scheduled mod post is unnecessary for the size and scope of this sub?

---

Update: u/OEIS-Tracker has been created! I'll run it once each Sunday to present newly-added sequences in posts that look like this. I've also contacted the creator of u/OEISbot to ignore the bot so it doesn't comment redundant info when these posts are made. Over a couple weeks I'll try to get an idea of how many sequences get added in a 7-day timespan, just to make sure the posts aren't too large. If necessary, I can switch to biweekly (Sunday + Wednesday). The bot's posts will not be pinned.


r/OEIS • • Sep 04 '22

Finite sequences with a lot of terms

12 Upvotes

A078814 (smallest prime factor of googolplex-1 which is > 16) is provably finite as it is concerned with numbers below 1010^100 , but that's still a lot of terms.

A056193 is a sequence beginning with 4. Briefly, write a(0) = 4 in hereditary base 2, as 22. Then "bump" the base and subtract 1 to get a(1) = 33 - 1 = 26. 26 can be written as 2*32 + 2*3 + 2, so bump each of the 3s and subtract 1 to get 2*42 + 2*4 + 1 = 41. You can then bump the base again to get 2*52 + 2*5 = 60, etc. It goes 4, 26, 41, 60, 83, 109, 139, 173...

Amazingly, no matter what value one starts with, even if it seems to explode (like 16, 7625597484986, 50973998591214355139406377...) the corresponding sequence will always go to zero! The linked sequence lasts 3*2402653211 - 3 terms which is well beyond 1010^8 terms!

A241293, being the decimal expansion for 44^(4^4) = 4^^4, pales given the first two, but still has 10153 terms. Many similar sequences for constants exist.

Are there OEIS sequences which have been proven finite, but for which we know nothing (or very little) about how many terms there are?


r/OEIS • • Aug 28 '22

Question how is A000612 handled for other divisors?

11 Upvotes

r/OEIS • • Feb 26 '23

What would a(n) = 0 through 4 of this sequence be?

Post image
10 Upvotes

r/OEIS • • Oct 02 '22

New OEIS sequences - week of 10/02

10 Upvotes
OEIS numberDescriptionSequence
A353654Numbers whose binary expansion has the same number of trailing 0 bits as other 0 bits.1, 3, 7, 10, 15, 22, 26, 31...
A354521a(n) is the position of the first letter in the US English name of n that can also be found in the English name of n+1.2, 1, 1, 3, 1, 2, 1, 2...
A354523Number of distinct letters in the English word for n that can also be found in the English word for n+1.2, 1, 1, 1, 1, 1, 1, 1...
A354548Number of edges in the graph of continuous discrete sections for a trivial bundle in a total space of the fiber bundle of size n.1, 8, 56, 296, 1380, 5952
A354586Table of Sprague-Grundy values for n X m 2D Toppling Dominoes L's read by antidiagonals.1, 2, 2, 3, 3, 3, 4, 4...
A354587Diagonal of Sprague-Grundy values for n X m 2D Toppling Dominoes L's.1, 3, 1, 7, 1, 3, 1, 15...
A354865a(n) is the hafnian of the 2n X 2n symmetric matrix whose element M_{i,j} equals phi(abs(i-j)).1, 1, 4, 49, 1193, 50228
A355077Types of joints numbered 1, 2 and 3, of placed matchsticks forming an infinite three-armed spiral with "thorns".0, 2, 3, 2, 2, 2, 2, 3...
A355178Decimal expansion of 2-2/3/L, where L is the conjectured Landau's constant A081760.1, 1, 5, 9, 5, 9, 5, 2...
A355194The number of evenly tagged partitions: partitions of n elements together with an involution defined on the set of classes which has at most one fixed point, such that a class and its image have the same number of elements.1, 1, 2, 4, 13, 41, 176, 722...
A355279Numbers k such that S(S(S(k))) = k, with S(n) = sigma(n)/4: 1/4-sociable numbers of order 1 or 3.30240, 32760, 2178540, 23569920, 45532800, 46475520, 48933360, 50995620...
A355412Count of numbers <= 10n with no prime factor greater than n.0, 6, 39, 66, 312, 506, 2154, 3426...
A355429Square array T(n, k), n >= 0, k > 0, read by antidiagonals, where T(0, k) = A001906(k) for k > 0 and where T(n, k) = n - A130312(n) + A000045(2k + A072649(n)) for n > 0, k > 0.1, 2, 3, 4, 5, 8, 6, 9...
A355611a(0) = 0; for n > 0, a(n) is the smallest positive number not previously occurring such that the binary string ofa(n) - a(n-1)
A355792Triangular array, read by rows. The rules of the construction are described in the Comments section.1, 1, 2, 2, 3, 1, 1, 2...
A355805Number of compositions (ordered partitions) of n into Pell numbers (A000129).1, 1, 2, 3, 5, 9, 15, 26...
A355847Irregular table read by rows, in which the rows list integers formed in the process in A180301, but generalized to other starting integers. A row ends when reaching a term in A180301.1, 2, 3, 12, 20, 21, 22, 200...
A355881Table read by descending antidiagonals: T(k,n) (k >= 0, n>= 1) is number of ways to (k+2)-color a 3 X n grid ignoring the variations of two colors.1, 1, 2, 1, 9, 3, 1, 41...
A355882Number of ways to 4-color a 3 X n grid ignoring the variations of two colors.3, 49, 801, 13095, 214083, 3499929, 57218481, 935434575...
A355883Number of ways to 5-color a 3 X n grid ignoring the variations of two colors.4, 169, 7141, 301741, 12749989, 538747549, 22764640981, 961914128461...
A355918Highest index in n-th inventory in A355916 and A355917.0, 1, 3, 5, 7, 11, 13, 16...
A355975a(1) = 1. For n >= 2, add to a(n-1) its prime or nonprime index to obtain a(n).1, 2, 3, 5, 8, 12, 19, 27...
A356047The number of links of a polyline that connects the midpoints of opposite sides of the n-th regular integer hexagon and has the following properties: the first link is 1; each subsequent one is 1 more than the previous one; the angle between adjacent links is equal to Pi/3; links of the same parity are parallel.2, 3, 44, 45, 626, 627, 8732, 8733...
A356188a(1)=1; for n > 1, if a(n-1) is prime then a(n) = the smallest number not yet in the sequence. Otherwise a(n) = a(n-1) + n - 1.1, 2, 3, 4, 8, 13, 5, 6...
A356197Number of Baxter 3-permutations of length n.1, 1, 4, 28, 260, 2872, 35620, 479508...
A356271Prime numbers in the sublists defined in A348168 that contain a single prime.2, 3, 5, 7, 23, 53, 89, 157...
A356422Heptagonal numbers (or 7-gonal numbers, i.e., numbers of the form k*(5*k - 3)/2) which are products of three distinct primes (or sphenics).286, 874, 970, 1918, 3367, 3553, 4558, 6682...
A356423Leyland numbers which are products of two distinct primes.57, 145, 177, 1649, 7073, 23401, 131361, 423393...
A3564249-gonal numbers that are semiprimes.9, 46, 111, 559, 1639, 3961, 4699, 7291...
A356444Number of ways to create an angle excess of n degrees using 3 regular polygons with integral internal angles.0, 1, 3, 1, 3, 6, 1, 3...
A356447Integers k such that (k+1)(2k-1) does not divide the central binomial coefficient B(k) = binomial(2*k,k) = A000984(k).2, 5, 8, 11, 14, 26, 29, 32...
A356466Prime numbers in the sublists defined in A348168 that contain exactly two primes.11, 13, 17, 19, 29, 31, 59, 61...
A356470Decimal expansion of (3 - sqrt(5))/(2*sqrt(2)).2, 7, 0, 0, 9, 0, 7, 5...
A356497a(n) = maximal 2k such that there exists a (2k)-th root of unity modulo n.1, 1, 2, 2, 4, 2, 2, 2...
A356531Primes p == 1 (mod 23) which are norms of elements in the 23rd cyclotomic field.599, 691, 829, 1151, 2347, 2393, 3037, 3313...
A356557Start with a(1)=2; to get a(n+1) insert in a(n) at the rightmost possible position the smallest possible digit such that the new number is a prime.2, 23, 233, 2333, 23333, 233323, 2333231, 23332301...
A356627Primes whose powers appear in A332979.2, 3, 5, 7, 11, 17, 29, 37...
A356649Domination number of the Cartesian product of three n-cycles.1, 2, 5, 12, 20, 36, 49
A356650Domination number of the Cartesian product of four n-cycles.1, 4, 9, 32
A356663Number of ways to create an angle excess of n degrees using 3 distinct regular polygons with integral internal angles.0, 1, 3, 1, 3, 5, 1, 3...
A356714Cardinality of the set{a_1+a_2+a_3+a_4: -floor((n-1)/2) <= a_1,a_2,a_3,a_4 <= floor(n/2), and a_12,a_22,a_32,a_42 are pairwise distinct}.0, 0, 0, 0, 0, 4, 7, 15...
A356716a(n) is the integer w such that (c(n)2, -d(n)2, -w) is a primitive solution to the Diophantine equation 2x3 + 2y3 + z3 = 113, where c(n) = F(n+2) + (-1)n * F(n-3), d(n) = F(n+1) + (-1)n * F(n-4) and F(n) is the n-th Fibonacci number (A000045).5, 19, 31, 101, 179, 655, 1189, 4451...
A356717a(n) is the integer w such that (c(n)2, -d(n)2, w) is a primitive solution to the Diophantine equation 2x3 + 2y3 + z3 = 113, where c(n) = F(n+2) + (-1)n * F(n-3), d(n) = F(n+3) + (-1)n * F(n-2) and F(n) is the n-th Fibonacci number (A000045).1, 29, 59, 241, 445, 1691, 3089, 11629...
A356739a(n) is the smallest k such that k! has at least n consecutive zeros immediately after the leading digit in base 10.7, 153, 197, 7399, 24434, 24434, 9242360, 238861211...
A356770a(n) is the number of equations in the set {x+2y=n, 2x+3y=n, ..., k*x+(k+1)y=n, ..., nx+(n+1)*y=n} which admit at least one nonnegative integer solution.1, 2, 3, 4, 4, 5, 5, 6...
A356784Inventory of positions as an irregular table; row 0 contains 0, subsequent rows contain the 0-based positions of 0's, followed by the position of 1's, of 2's, etc. in prior rows flattened.0, 0, 0, 1, 0, 1, 2, 3...
A356802A refinement of the Mahonian numbers.1, 1, 1, 1, 2, 2, 1, 1...
A356810Decimal expansion of the unique root of the equation xx((log(xx-1 - 1)/(log(x) - 1))) = x+1 for x in the interval [1,2].1, 8, 4, 4, 1, 6, 2, 9...
A356872a(n) = k is the smallest number such that 3*k+1 contains n distinct prime factors.1, 3, 23, 303, 4363, 56723, 1077743, 33410043...
A356915Number of partitions of n into 4 parts that divide n.0, 0, 0, 1, 0, 2, 0, 2...
A356918Triangle read by rows where T(n,k) is Colijn and Plazzotta's distance metric d_1(n,k) between rooted binary tree numbers n and k, for 1 <= k <= n.0, 2, 0, 4, 2, 0, 6, 4...
A356919Number of partitions of n into 5 parts that divide n.0, 0, 0, 0, 1, 1, 0, 2...
A356920Number of partitions of n into 6 parts that divide n.0, 0, 0, 0, 0, 1, 0, 1...
A356921Irregular table read by rows: necklaces on the alphabet {0,1} sorted by length then by lexicographic order of minimum rotation.0, 1, 0, 0, 0, 1, 1, 1...
A356922Irregular table read by rows: bracelets on the alphabet {0,1} sorted by length then by lexicographic order of minimum rotation.0, 1, 0, 0, 0, 1, 1, 1...
A356923Irregular table read by rows: invertible necklaces on the alphabet {0,1} sorted by length then by lexicographic order of minimum presentation.0, 0, 0, 0, 1, 0, 0, 0...
A356924Irregular table read by rows: invertible bracelets on the alphabet {0,1} sorted by length then by lexicographic order of minimum presentation.0, 0, 0, 0, 1, 0, 0, 0...
A356956Numbers k such that the k-th composition in standard order is a gapless interval (in increasing order).0, 1, 2, 4, 6, 8, 16, 20...
A356978a(n) is the first number k such that ki is a quasi-Niven number (A209871) for 1<=i<=n but not for i=n+1.13, 11, 1145, 121, 31109, 1510081, 34110497, 5343853441...
A356988a(n) = n - a2 with a(1) = 1, where a2 = a(a(n)) and a3 = a(a(a(n))).1, 1, 2, 3, 3, 4, 5, 5...
A356989a(n) = n - a3 with a(1) = 1, where a3 = a(a(a(n))) and a4 = a(a(a(a(n)))).1, 1, 2, 3, 4, 4, 5, 6...
A356990a(n) = n - a4 with a(1) = 1, where a4 = a(a(a(a(n)))) and a5 = a(a(a(a(a(n))))).1, 1, 2, 3, 4, 5, 5, 6...
A357013Triangle read by rows. T(n, k) = ((2*n)! * k!) / (n + k)!.1, 2, 1, 12, 4, 2, 120, 30...
A357057a(n) = A356886(2n+1)/A356886(2n-1).3, 3, 3, 5, 5, 7, 11, 11...
A357059Decimal expansion of sum of squares of reciprocals of primes whose distance to the next prime is equal to 4, Sum_{j>=1} 1/A029710(j)2.0, 3, 1, 3, 2, 1, 6, 2...
A357075Numbers sandwiched between numbers with exactly three distinct prime factors.131, 139, 155, 169, 181, 221, 229, 239...
A357076Numbers k sandwiched between twin primes, such that k times the reverse of k is also sandwiched between twin primes.198, 642, 1050, 2730, 3000, 4050, 4230, 4272...
A357080Numbers k such that the sum of the digits of k multiplied by the sum of the digits of k2 equals k.0, 1, 80, 162, 243, 476, 486
A357098Emirps p such that the average of p and its digit reversal is an emirp.1001941, 1008701, 1012481, 1012861, 1034861, 1035641, 1037081, 1040981...
A357117Sums of two consecutive primes whose reversal is also the sum of two consecutive primes.5, 8, 24, 42, 210, 222, 240, 258...
A357122Numbers k such that the sum of (q mod p) for pairs of primes p<q such that p+q=2*k is prime.4, 6, 7, 8, 9, 11, 13, 19...
A357134Take the k-th composition in standard order for each part k of the n-th composition in standard order; then set a(n) to be the index (in standard order) of the concatenation.0, 1, 2, 3, 3, 5, 6, 7...
A357135Take the k-th composition in standard order for each part k of the n-th composition in standard order; then concatenate.1, 2, 1, 1, 1, 1, 2, 1...
A357136Triangle read by rows where T(n,k) is the number of integer compositions of n with alternating sum k = 0..n. Part of the full triangle A097805.1, 0, 1, 1, 0, 1, 0, 2...
A357139Take the weakly increasing prime indices of each prime index of n, then concatenate.1, 2, 1, 1, 1, 1, 1, 2...
A357145Decimal expansion of Sum_{n>=1} 1/A003422(n).1, 8, 8, 7, 2, 4, 2, 8...
A357178First differences of cubes of triangular numbers.0, 1, 26, 189, 784, 2375, 5886, 12691...
A357180First run-length of the n-th composition in standard order.0, 1, 1, 2, 1, 1, 1, 3...
A357181Last run-length of the n-th composition in standard order.0, 1, 1, 2, 1, 1, 1, 3...
A357182Number of integer compositions of n with the same length as their alternating sum.1, 1, 0, 0, 1, 3, 1, 4...
A357183Number of integer compositions with the same length as the absolute value of their alternating sum.1, 1, 0, 0, 2, 3, 2, 5...
A357184Numbers k such that the k-th composition in standard order has the same length as its alternating sum.0, 1, 9, 19, 22, 28, 34, 69...
A357185Numbers k such that the k-th composition in standard order has the same length as the absolute value of its alternating sum.0, 1, 9, 12, 19, 22, 28, 34...
A357186Take the k-th composition in standard order for each part k of the n-th composition in standard order, then add up everything.0, 1, 2, 2, 2, 3, 3, 3...
A357187First differences A357186 = "Take the k-th composition in standard order for each part k of the n-th composition in standard order, then add up everything."1, 1, 0, 0, 1, 0, 0, 0...
A357188Numbers with (WLOG adjacent) prime indices x <= y such that the greatest prime factor of x is greater than the least prime factor of y.35, 65, 70, 95, 105, 130, 140, 143...
A357189Number of integer partitions of n with the same length as alternating sum.1, 1, 0, 0, 1, 1, 1, 2...
A357213Triangular array read by rows: T(n, k) = number of subsets s of {1, 2, ..., n} such max(s) - min(s) = k, for n >= 1, 0 <= k <= n-1.1, 2, 1, 3, 2, 2, 4, 3...
A357214a(n) = number of subsets S of {1, 2,..., n} such that every number in S is a composite.1, 1, 1, 2, 2, 4, 4, 8...
A357215a(n) = number of nonempty subsets S of {1, 2, ..., n} that contain only primes.0, 1, 3, 3, 7, 7, 15, 15...
A357230Coefficients a(n) of x2*n-1/(2n-1)! in the expansion of the odd function S(x) defined by: S(x) = Integral Product_{n>=1} C(n,x)^(2n-1) dx, where C(n,x) = (1 + S(x)2*n)1/(2*n) for n >= 1.1, 1, 19, 1339, 126121, 22936441, 6074972299, 2211448022179...
A357234a(n) is the maximum length of a snake-like polyomino in an n X n square that starts and ends at opposite corners.1, 3, 5, 7, 17, 23, 31, 39...
A357237Number of compositions (ordered partitions) of n into distinct parts of the form 2j - 1.1, 1, 0, 1, 2, 0, 0, 1...
A357255Triangular array: row n gives the recurrence coefficients for the sequence (c(k) = number of subsets of {1,2,...,n} that have at least k-1 elements) for k >= 1.2, 3, -2, 4, -5, 2, 5, -9...
A357264Circumference of the n x n giraffe graph.16, 28, 46, 62, 80, 100
A357266Number of n-node tournaments that have exactly five circular triads.24, 3648, 90384, 1304576, 19958400, 311592960, 5054353920, 85709352960...
A357268If n is a power of 2, a(n) = n. Otherwise, if 2j is the greatest power of 2 not exceeding n, and if k = n - 2j, then a(n) is the smallest m*a(k) which has not occurred already, where m is an odd number.1, 2, 3, 4, 5, 6, 9, 8...
A357276Middle side of integer-sided primitive triangles whose angles satisfy A < B < C = 2*Pi/3 = 120 degrees.5, 8, 16, 24, 33, 35, 39, 56...
A357279a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i, j] = i + j - 1.1, 2, 43, 2610, 312081, 61825050
A357282a(n) = number of subsets S of {1,2,...,n} having more than 1 element such that (difference between least two elements of S) = difference between greatest two elements of S.0, 0, 1, 4, 9, 18, 33, 60...
A357283a(n) = number of subsets S of {1,2,...,n} having more than 1 element such that (sum of least two elements of S) < max(S).0, 0, 0, 0, 2, 8, 26, 68...
A357284a(n) = (1/2)*A357283(n).0, 0, 0, 0, 1, 4, 13, 34...
A357300a(n) is the smallest number m with exactly n divisors whose first digit equals the first digit of m.1, 10, 100, 108, 120, 180, 1040, 1020...
A357302Numbers k such that k2 can be represented as x2 + x*y + y2 in more ways than for any smaller k.1, 7, 49, 91, 637, 1729, 12103, 53599...
A357303Records in the numbers of representations of k2 as x2 - xy + y2, x > 2y >= 0, corresponding to the numbers of grid points with squared radius A357302(n)2 in an angular sector 0 <= phi < Pi/6 of the triangular lattice.1, 2, 3, 5, 8, 14, 23, 41...
A357304Records of the Hamming weight of squares.0, 1, 2, 3, 5, 6, 7, 8...
A357305Numbers k > 1 such that the ratio (numbers of zeros)/(total length) in the binary representation of k2 is a new minimum.2, 3, 5, 11, 45, 181, 48589783221, 66537313397...
A357306Number of compositions (ordered partitions) of n into distinct Lucas numbers (beginning at 2).1, 1, 1, 3, 3, 4, 8, 9...
A357316A distension of the Wythoff array by inclusion of intermediate rows. Square array A(n,k), n >= 0, k >= 0, read by descending antidiagonals. If S is the set such that Sum_{i in S} F_i is the Zeckendorf representation of n then A(n,k) = Sum_{i in S} F_{i+k-2}.0, 0, 0, 0, 1, 1, 0, 1...
A357317Inventory count sequence: record what you see and where it is located.0, 1, 0, 0, 3, 0, 0, 2...
A357318Decimal expansion of 1/(2*L), where L is the conjectured Landau's constant A081760.9, 2, 0, 3, 7, 1, 3, 7...
A357328Number of permutations p of [n] such that p(i) divides p(j) if i divides j for 1 <= i <= j <= n.1, 1, 1, 2, 1, 2, 1, 2...
A357329Triangular array read by rows: T(n, k) = number of occurrences of 2k as a sum1 - p(1)
A357339Triangle read by rows. T(n, k) = Sum_{j=0..n-k}(binomial(-n, j) * A268437(n - k, j).1, -1, 1, 10, -2, 1, -270, 24...
A357340Triangle read by rows. T(n, k) = Sum_{j=0..n-k}(binomial(-n, j) * A268438(n - k, j).1, -1, 1, 2, -2, 1, 0, 12...
A357341a(n) = Sum_{k=0..n} (-1)n - k * A357340(n, k).1, 2, 5, 16, 97, 2186, 57661, 1018732...
A357342a(n) = Sum_{k=0..n} ((-1)n - k * A357339(n, k)).1, 2, 13, 298, 14825, 1238896, 154892713, 27009853886...
A357352Number of partitions of n into distinct positive triangular numbers such that the number of parts is a triangular number.1, 1, 0, 1, 0, 0, 1, 0...
A357354Number of partitions of n into distinct positive squares such that the number of parts is a square.1, 1, 0, 0, 1, 0, 0, 0...
A357355Number of nonempty subsets of {1..n} whose elements have an odd average.1, 1, 2, 4, 9, 13, 20, 38...
A357356Number of nonempty subsets of {1..n} whose elements have an even average.0, 1, 3, 4, 6, 13, 25, 38...
A357357Length of the longest induced cycle in the n X n grid graph.0, 4, 8, 12, 16, 20, 32, 40...
A357358Length of the longest induced cycle in the n X n torus grid graph.6, 8, 15, 20, 28, 40
A357359Maximum number of nodes in an induced path (or chordless path or snake path) in the n X n torus grid graph.5, 8, 14, 21, 28, 39, 50
A357360Maximum length of an induced path (or chordless path or snake path) between two antipodal nodes of the n-dimensional hypercube.0, 1, 2, 3, 4, 11, 24
A357361Smallest number k such that A345112(k) = n.1, 5, 19, 118, 89, 123, 102, 145...
A357363Primes p such that either pq-1 == 1 (mod q2) or qp-1 == 1 (mod p2), where q = A151800(A151800(p)).5, 19, 263, 1667
A357364Primes p such that either pq-1 == 1 (mod q2) or qp-1 == 1 (mod p2), where q = A151800(A151800(A151800(p))).11, 23, 41, 107, 389, 1987673, 35603983
A357366Expansion of Product_{k>=0} 1 / (1 - x2^k - x2k+1)2^k.1, 1, 4, 5, 18, 23, 59, 82...
A357367Triangle read by rows. T(n, k) = Sum_{m=0..k} ((-1)m + k * binomial(n + k, n + m) * L(n + m, m), where L denotes the unsigned Lah numbers A271703.1, 0, 2, 0, 6, 12, 0, 24...
A357370Positions of 0's in A355917.1, 3, 7, 13, 21, 33, 47, 64...
A357371a(1) = 1, thereafter, first differences of A357370.1, 2, 4, 6, 8, 12, 14, 17...
A357372Square array A(n, k), n, k > 0, read by antidiagonals; A(n, k) is the numerator of 1/n + 1/k.2, 3, 3, 4, 1, 4, 5, 5...
A357374Number of ordered factorizations of n into numbers > 1 with an even number of prime divisors (prime factors counted with multiplicity).1, 0, 0, 1, 0, 1, 0, 0...
A357375Number of ordered factorizations of n into numbers > 1 with an even number of distinct prime divisors.1, 0, 0, 0, 0, 1, 0, 0...
A357377a(0) = 0; for n > 0, a(n) is the smallest positive number not previously occurring such thata(n) - a(n-1)
A357378Lexicographically earliest sequence of positive integers such that the values a(floor(n/2)) * a(n) are all distinct.1, 2, 2, 3, 4, 5, 1, 3...
A357379a(n) = A357378(floor(n/2)) * A357378(n).1, 2, 4, 6, 8, 10, 3, 9...
A357380Expansion of Product_{k>=1} (1 - xFibonacci(k)).1, -2, 0, 1, 1, -1, 0, 1...
A357381Expansion of Product_{k>=1} 1 / (1 + xFibonacci(k)).1, -2, 2, -3, 5, -7, 9, -11...
A357382Expansion of Product_{k>=1} (1 - xLucas(k)).1, -1, 0, -1, 0, 1, 0, 0...
A357383Expansion of Product_{k>=1} 1 / (1 + xLucas(k)).1, -1, 1, -2, 1, -1, 2, -2...
A357384Expansion of 1 / (1 + Sum_{k>=1}(-x)Lucas(k)).1, 1, 1, 2, 2, 2, 3, 4...
A357385a(n) = A071626(n+1) - A071626(n).1, 0, 1, 0, 1, 0, 0, 0...
A357386a(n) is the start of the least run of exactly n consecutive positive integers with the same value of A071626, or -1 if no such run exists.1, 2, 116, 6, 10, 290, 15, 333...
A357387Starts of record-length runs of consecutive positive integers with the same value of A071626.1, 2, 6, 10, 15, 22, 68, 153...
A357388Numbers k such that A071626(k) < A071626(k+1).1, 3, 5, 9, 14, 21, 32, 43...
A357389a(n) is the start of the least run of exactly n consecutive positive integers with strictly increasing values of A071626, or -1 if no such run exists.7, 1, 736, 26048, 991434
A357390Numbers k such that A071626(k) > A071626(k+1).64, 113, 132, 151, 216, 247, 278, 309...
A357391a(n) is the start of the least run of exactly n consecutive positive integers with strictly decreasing values of A071626, or -1 if no such run exists.1, 64, 730, 8755, 12734, 8419585
A357392E.g.f. satisfies A(x) = -log(1 - x * exp(2 * A(x))).0, 1, 5, 56, 990, 24024, 742560, 27907200...
A357393E.g.f. satisfies A(x) = -log(1 - x * exp(3 * A(x))).0, 1, 7, 110, 2730, 93024, 4037880, 213127200...
A357394E.g.f. satisfies A(x) = exp(x * exp(2 * A(x))) - 1.0, 1, 5, 55, 953, 22651, 685525, 25222359...
A357395E.g.f. satisfies A(x) = exp(x * exp(3 * A(x))) - 1.0, 1, 7, 109, 2677, 90226, 3873007, 202134997...
A357396Inverse of A357379.0, 1, 6, 2, 10, 3, 12, 4...
A357400Coefficients T(n,k) of xn*yk in the function A(x,y) that satisfies: y = Sum_{n=-oo..+oo} x2*n+1 * (1 - xn)n+1 * A(x,y)n, as a triangle read by rows with k = 0..n for each row index n >= 0.1, 0, 1, 0, 0, 2, 0, 1...
A357401Coefficients in the power series expansion of 1/Sum_{n=-oo..+oo} n * x2*n+1 * (1 - xn)n+1.1, 0, 1, 0, -2, 8, -14, 16...
A357402Coefficients in the power series A(x) such that: 2 = Sum_{n=-oo..+oo} x2*n+1 * (1 - xn)n+1 * A(x)n.1, 2, 8, 42, 236, 1420, 8976, 58644...
A357403Coefficients in the power series A(x) such that: 3 = Sum_{n=-oo..+oo} x2*n+1 * (1 - xn)n+1 * A(x)n.1, 3, 18, 138, 1161, 10470, 98979, 967719...
A357404Coefficients in the power series A(x) such that: 4 = Sum_{n=-oo..+oo} x2*n+1 * (1 - xn)n+1 * A(x)n.1, 4, 32, 324, 3632, 43640, 549472, 7154952...
A357405Coefficients in the power series A(x) such that: 5 = Sum_{n=-oo..+oo} x2*n+1 * (1 - xn)n+1 * A(x)n.1, 5, 50, 630, 8825, 132490, 2084115, 33903705...
A357406Coefficients in the power series expansion of A(x) = Sum_{n=-oo..+oo} n * x2*n+2 * (1 - xn)n+1.1, 0, -1, 0, 3, -8, 9, 0...
A357410a(n) is the number of covering relations in the poset P of n X n idempotent matrices over GF(2) ordered by A <= B if and only if AB = BA = A.0, 1, 12, 224, 6960, 397792, 42001344, 8547291008...
A357411Number of nonempty subsets of {1..n} whose elements have an odd harmonic mean.1, 1, 2, 2, 3, 5, 6, 6...
A357412Number of nonempty subsets of {1..n} whose elements have an even harmonic mean.0, 1, 1, 2, 2, 7, 7, 8...
A357413Number of nonempty subsets of {1..n} whose elements have an odd geometric mean.1, 1, 2, 2, 3, 3, 4, 4...
A357414Number of nonempty subsets of {1..n} whose elements have an even geometric mean.0, 1, 1, 4, 4, 5, 5, 8...
A357415Number of nonempty subsets of {1..n} whose elements have an odd root mean square.1, 1, 2, 2, 3, 3, 6, 6...
A357416Number of nonempty subsets of {1..n} whose elements have an even root mean square.0, 1, 1, 2, 2, 3, 3, 4...
A357418Decimal expansion of (207 - 33*sqrt(33))/32.5, 4, 4, 6, 6, 9, 7, 7...
A357419a(n) is the hafnian of the 2n X 2n symmetric Pascal matrix defined by M[i, j] = A007318(i + j - 2, i - 2).1, 1, 17, 4929, 23872137, 1901611778409
A357420a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i,j] = abs(i - j) if min(i, j) < max(i, j) <= 2*min(i, j), and otherwise 0.1, 1, 1, 8, 86, 878
A357421a(n) is the hafnian of the 2n X 2n symmetric matrix whose generic element M[i,j] is equal to the digital root of i*j.1, 2, 54, 1377, 55350, 4164534
A357422E.g.f. satisfies A(x) * exp(A(x)) = -log(1 - x * exp(A(x))).0, 1, 1, 5, 34, 324, 3936, 58190...
A357423E.g.f. satisfies A(x) * exp(A(x)) = log(1 + x * exp(A(x))).0, 1, -1, -1, 10, 4, -384, 818...
A357424E.g.f. satisfies A(x) * exp(A(x)) = exp(x * exp(A(x))) - 1.0, 1, 1, 4, 21, 156, 1470, 16843...
A357425Smallest number for which the sum of digits in fractional base 4/3 is n.0, 1, 2, 3, 5, 6, 7, 10...
A357427Expansion of Product_{k>=0} 1 / (1 + xLucas(k)).1, -1, 0, -1, 1, 0, 1, -2...
A357428Numbers whose digit representation in base 2 is equal to the digit representation in base 2 of the initial terms of their sets of divisors in increasing order.1, 6, 52, 63, 222, 2037, 6776, 26896...
A357429Numbers whose digit representation in base 3 is equal to the digit representation in base 3 of the initial terms of their sets of divisors in increasing order.1, 48, 50, 333, 438, 448, 734217, 6561081...
A357430a(n) is the least integer > 1 such that its digit representation in base n is equal to the digit representation in base n of the initial terms of its set of divisors in increasing order.6, 48, 6, 182, 8, 66, 10, 102...
A357434a(n) is the number of distinct Q-toothpicks after the n-th stage of the structure described in A211000.0, 1, 2, 3, 4, 5, 6, 7...
A357436Start with a(1)=2; to get a(n+1) insert in a(n) the smallest possible digit at the rightmost possible position such that the new number is a prime.2, 23, 223, 2203, 22003, 220013, 2200103, 22000103...
A357438Triangle T(n,k) read by rows, defined by the equation f(x, y) := Sum_{n, k} T(n, k) * yk * xn = 1/(1 - xy - x^2y*f(x, y+1)).1, 0, 1, 0, 1, 1, 0, 1...
A357448Fixed point starting with 0 of the two-block substitution 00->010, 01->010, 10->101, 11->101.0, 1, 0, 0, 1, 0, 1, 0...
A357449a(0) = 0; for n > 0, a(n) is the smallest positive number not previously occurring such that the binary string of a(n) plus the largest previous term does not appear in the binary string concatenation of a(0)..a(n-1).0, 1, 2, 3, 4, 5, 10, 6...
A357450a(n) is the smallest integer having exactly n odd square divisors (A298735).1, 9, 81, 225, 6561, 2025, 531441, 11025...
A357451Number of compositions (ordered partitions) of n into tribonacci numbers 1,2,4,7,13,24, ... (A000073).1, 1, 2, 3, 6, 10, 18, 32...
A357452Number of partitions of n into tetranacci numbers 1,2,4,8,15,29, ... (A000078).1, 1, 2, 2, 4, 4, 6, 6...
A357453Number of compositions (ordered partitions) of n into tetranacci numbers 1,2,4,8,15,29, ... (A000078).1, 1, 2, 3, 6, 10, 18, 31...
A357454Number of partitions of n into pentanacci numbers 1,2,4,8,16,31, ... (A001591).1, 1, 2, 2, 4, 4, 6, 6...
A357455Number of compositions (ordered partitions) of n into pentanacci numbers 1,2,4,8,16,31, ... (A001591).1, 1, 2, 3, 6, 10, 18, 31...
A357456Number of partitions of n into two or more odd parts.0, 0, 1, 1, 2, 2, 4, 4...
A357457Number of partitions of n into two or more distinct odd parts.0, 0, 0, 0, 1, 0, 1, 0...
A357458First differences of A325033 = "Sum of sums of the multiset of prime indices of each prime index of n."0, 1, -1, 2, -1, 1, -2, 2...
A357459The total number of fixed points among all partitions of n, when parts are written in nondecreasing order.0, 1, 1, 3, 4, 7, 10, 17...
A357460Numbers whose number of deficient divisors is equal to their number of nondeficient divisors.72, 108, 120, 168, 180, 252, 420, 528...
A357461Odd numbers whose number of deficient divisors is equal to their number of nondeficient divisors.3010132125, 4502334375, 5065535475, 6456074625, 8813660625, 9881746875, 15395254875, 15452011575...
A357462Numbers whose sum of deficient divisors is equal to their sum of nondeficient divisors.6, 28, 30, 42, 66, 78, 102, 114...
A357478Numbers n such that both n and n+1 are in A175729.7105, 37583, 229177, 309281, 343865, 480654, 794625, 808860...
A357479a(n) = (n!/6) * Sum_{k=0..n-3} 1/k!.0, 0, 0, 1, 8, 50, 320, 2275...
A357480a(n) = (n!/24) * Sum_{k=0..n-4} 1/k!.0, 0, 0, 0, 1, 10, 75, 560...
A357481a(n) is the least integer b such that the digit representation of n in base b is equal to the digit representation in base b of the initial terms of the sets of divisors of n in increasing order, or -1 if no such b exists.2, -1, -1, -1, -1, 2, -1, 6...
A357483Decimal expansion of sum of squares of reciprocals of primes whose distance to the next prime is equal to 6, Sum_{j>=1} 1/A031924(j)2.0, 0, 4, 7, 5, 7, 2, 8...
A357485Heinz numbers of integer partitions with the same length as reverse-alternating sum.1, 2, 20, 42, 45, 105, 110, 125...
A357486Heinz numbers of integer partitions with the same length as alternating sum.1, 2, 10, 20, 21, 42, 45, 55...
A357487Number of integer partitions of n with the same length as reverse-alternating sum.1, 1, 0, 0, 0, 1, 0, 2...
A357491Distinct values in A356784, in order of appearance.0, 1, 2, 3, 4, 5, 6, 7...
A357492Inverse permutation to A357491.0, 1, 2, 3, 4, 5, 6, 7...
A357493Numbers k such that s(k) = 3*k, where s(k) is the sum of divisors of k that have a square factor (A162296).480, 2688, 56304, 89400, 195216, 2095104, 9724032, 69441408...
A357494Numbers k such that s(k) = 4*k, where s(k) is the sum of divisors of k that have a square factor (A162296).902880, 1534680, 361674720, 767685600, 4530770640, 4941414720, 5405788800, 5517818880...
A357495Lesser of a pair of amicable numbers k < m such that s(k) = m and s(m) = k, where s(k) = A162296(k) - k is the sum of aliquot divisors of k that have a square factor.880, 10480, 20080, 24928, 42976, 69184, 110565, 252080...
A357496Greater of a pair of amicable numbers k < m such that s(k) = m and s(m) = k, where s(k) = A162296(k) - k is the sum of aliquot divisors of k that have a square factor.1136, 11696, 22256, 25472, 43424, 73664, 131355, 304336...
A357497Nonsquarefree numbers whose harmonic mean of nonsquarefree divisors in an integer.4, 9, 12, 18, 24, 25, 28, 45...
A357499Triangle read by rows: T(n,k) is the length of the longest induced path in the n-dimensional hypercube, such that the end points of the path are at Hamming distance k, 0 <= k <= n.0, 0, 1, 0, 1, 2, 0, 1...
A357500Largest number of nodes of an induced path in the n X n knight graph.1, 1, 7, 9, 15, 21, 24, 34...
A357501Length of longest induced cycle in the n X n king graph.0, 3, 4, 8, 12, 16, 24, 31...
A357503a(n) is the hafnian of the 2n X 2n symmetric matrix whose element (i,j) equals abs(i-j).1, 1, 8, 174, 7360, 512720
A357504Numbers that are the sum of two distinct triangular numbers.1, 3, 4, 6, 7, 9, 10, 11...
A357505Numbers that are not sum of two distinct triangular numbers.0, 2, 5, 8, 12, 14, 17, 19...
A357509a(n) = 2binomial(3n,n) - 9binomial(2n,n).-7, -12, -24, -12, 360, 3738, 28812, 201672...
A357515Smallest positive integer that doubles when the n rightmost digits are shifted to the left end.105263157894736842, 100502512562814070351758793969849246231155778894472361809045226130653266331658291457286432160804020
A357518Unique fixed point of the two-block substitution 00->111, 01->110, 10->101, 11->100.1, 0, 1, 1, 0, 0, 1, 1...
A357519Number of compositions (ordered partitions) of n into Jacobsthal numbers 1,3,5,11,21,43, ... (A001045).1, 1, 1, 2, 3, 5, 8, 12...
A357520Expansion of Product_{k>=0} (1 - xLucas(k)).1, -1, -1, 0, 0, 2, 0, -1...
A357521Expansion of Product_{k>=1} (1 - mu(k)*xk).1, -1, 1, 0, -1, 2, -3, 3...
A357524Expansion of Product_{k>=1} 1 / (1 + mu(k)*xk).1, -1, 2, -1, 2, 0, 1, 2...
A357525Expansion of Product_{k>=1} (1 + mu(k)*xk).1, 1, -1, -2, -1, 0, 1, 1...

r/OEIS • • Feb 06 '18

(x-post from r/Math) The On-Line Encyclopedia of Integer Sequences (OEIS) is about to add its 300000th sequence

Thumbnail
self.math
10 Upvotes

r/OEIS • • Jul 20 '16

Open problems in the OEIS

Thumbnail neilsloane.com
10 Upvotes

r/OEIS • • Dec 30 '22

[a little late]: Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS

Thumbnail oeisf.org
9 Upvotes

r/OEIS • • Dec 04 '22

New OEIS sequences - week of 12/04

7 Upvotes
OEIS numberDescriptionSequence
A357280Smallest m such that mk-2 and mk+2 are prime for k=1..n.5, 9, 102795, 559838181, 27336417022509
A357547a(n) = coefficient of xn in A(x) such that: A(x)2 = A( x2/(1 - 4x - 4x2) ).1, 2, 9, 38, 176, 832, 4039, 19938...
A357548a(n) = coefficient of xn in A(x) where A(x)2 = A( x2/(1 - 4x - 8x2) ).1, 2, 11, 50, 261, 1362, 7344, 40112...
A357675Smallest m such that A357477(m) = n.3, 2, 1, 31, 34, 19, 77, 67...
A357676Indices at which record high values in A357477 appear.1, 19, 67, 154, 218, 251, 601, 651...
A357757We draw n non-crossing straight line segments inside an n X n square between 2*n grid points on its perimeter, allowing no more similar connections between the remaining perimeter grid points. a(n) is the count of distinct possibilities for each n without duplicates by rotation or reflection.1, 2, 18, 86
A357785a(n) = coefficient of xn, n >= 1, in A(x) such that: A(x)2 = A( x2/(1 - 4x - 4x2) ) * sqrt(1 - 4x - 4x2).1, 1, 4, 15, 65, 291, 1356, 6474...
A357786a(n) = coefficient of xn, n >= 1, in A(x) such that: A(x)2 = A( x2/(1 - 4x - 8x2) ) * sqrt(1 - 4x - 8x2).1, 1, 5, 20, 98, 483, 2499, 13182...
A357954Integers k that are periodic points for some iterations of k->A357143(k).1, 2, 3, 4, 13, 18, 28, 118...
A358053a(n) = 14*n - 1.13, 27, 41, 55, 69, 83, 97, 111...
A358107Number of unlabeled trees covering 2n nodes, half of which are leaves.1, 1, 2, 6, 26, 119, 626, 3495...
A358148Aliquot sequence starting at 326.326, 166, 86, 46, 26, 16, 15, 9...
A358212a(n) is the maximal possible sum of squares of the side lengths of an n2-gon supported on a subset 1 <= x,y <= n of an integer lattice.4, 10, 36
A358216Inverse Möbius transform of A327936, where A327936 is multiplicative with a(pe) = p if e >= p, otherwise 1.1, 2, 2, 4, 2, 4, 2, 6...
A358223Inverse Möbius transform of A181819, prime shadow function.1, 3, 3, 6, 3, 9, 3, 11...
A358230Lexicographically earliest infinite sequence such that a(i) = a(j) => A007814(i) = A007814(j), A007949(i) = A007949(j) and A046523(i) = A046523(j), for all i, j, where A007814 and A007949 give the 2-adic and 3-adic valuation, and A046523 gives the prime signature of its argument.1, 2, 3, 4, 5, 6, 5, 7...
A358233Number of ways n can be expressed as an unordered product of two natural numbers that do not generate any carries when added together in the primorial base.0, 1, 0, 2, 0, 2, 0, 1...
A358234Number of ways 2n can be expressed as an unordered product of two natural numbers that do not generate any carries when added together in the primorial base.1, 2, 2, 1, 1, 2, 2, 2...
A358235Number of ways n' (the arithmetic derivative of n) can be formed as a sum (x * y') + (x' * y) from two factors x and y of n, with x <= y, so that the said sum does not involve any carries when the addition is done in the primorial base.1, 1, 1, 2, 1, 2, 1, 1...
A358236Number of factorizations of n where the sum of the factors is carryfree when the addition is done in the primorial base.1, 1, 1, 2, 1, 2, 1, 1...
A358244Number of n-regular, N_0-weighted pseudographs on 2 vertices with total edge weight 4, up to isomorphism.1, 6, 13, 27, 38, 55, 67, 85...
A358245Number of n-regular, N_0-weighted pseudographs on 2 vertices with total edge weight 5, up to isomorphism.1, 6, 17, 36, 59, 87, 114, 145...
A358246Number of n-regular, N_0-weighted pseudographs on 2 vertices with total edge weight 6, up to isomorphism.1, 8, 23, 55, 92, 147, 196, 260...
A358247Number of n-regular, N_0-weighted pseudographs on 2 vertices with total edge weight 7, up to isomorphism.1, 8, 28, 71, 132, 217, 309, 417...
A358248Number of n-regular, N_0-weighted pseudographs on 2 vertices with total edge weight 8, up to isomorphism.1, 10, 35, 99, 190, 332, 484, 680...
A358249Number of n-regular, N_0-weighted pseudographs on 2 vertices with total edge weight 9, up to isomorphism.1, 10, 42, 123, 259, 469, 721, 1034...
A358291a(n) = smallest k not already in the sequence such that OEIS entry Ak contains n.1, 2, 3, 5, 6, 8, 9, 15...
A358292Array read by antidiagonals: T(n,k) = n3k3*(n+k)2, n>=0, k>=0.0, 0, 0, 0, 4, 0, 0, 72...
A358293Array read by antidiagonals: T(n,k) = n3k3*(n+k)2, n>=1, k>=1.4, 72, 72, 432, 1024, 432, 1600, 5400...
A358294Triangle read by rows: T(n,k) = n3k3*(n+k)2, n>=0, 0 <= k <= n.0, 0, 4, 0, 72, 1024, 0, 432...
A358295Triangle read by rows: T(n,k) = n3k3*(n+k)2, n>=1, 1 <= k <= n.4, 72, 1024, 432, 5400, 26244, 1600, 18432...
A358349A puzzle array read by antidiagonals.1, 2, 1, 3, 3, 1, 4, 9...
A358354a(n) = n for n <= 3. Thereafter a(n) is the least m such that rad(m) = rad(rad(a(n-3)) + rad(a(n-1))) where rad is A007947.1, 2, 3, 4, 8, 5, 7, 9...
A358435Row sums of the triangular array A357498.1, 4, 8, 16, 22, 36, 47, 68...
A358532a(n) is the row position of the next open point in the structure generated by adding the largest diamond possible at the next open point on a triangular grid of side n. See Comments and Example sections for more details.1, 1, 2, 1, 2, 3, 1, 4...
A358548a(n) = A003627(n+1) - A003627(n).3, 6, 6, 6, 6, 12, 6, 6...
A358549Triangle read by rows where row n is reversed partial sums of row n of the Sierpinski triangle (A047999).1, 2, 1, 2, 1, 1, 4, 3...
A358558a(n) is the number of pairs (k,m) of positive integers with 1 <= k < m <= n such that gcd(k,m) = 2t, t > 0.0, 0, 0, 1, 1, 3, 3, 6...
A358598Number of genetic relatives of a person M in a genealogical tree extending back n generations and where everyone has 4 children down to the generation of M.1, 6, 40, 300, 2356, 18756, 149860, 1198500...
A358620Number of nonzero digits needed to write all nonnegative n-digit integers.9, 171, 2520, 33300, 414000, 4950000, 57600000, 657000000...
A358624Triangle read by rows. The coefficients of the Hahn polynomials in ascending order of powers. T(n, k) = n! * [xk] hypergeom([-x, -n, n + 1], [1, 1], 1).1, 1, 2, 2, 6, 6, 6, 22...
A358625a(n) = numerator of Bernoulli(n, 1) / n for n >= 1, a(0) = 1.1, 1, 1, 0, -1, 0, 1, 0...
A358647Final digit reached by traveling right (with wraparound) through the digits of n. Each move steps right k places, where k is the digit at the beginning of the move. Moves begin at the most significant digit and d moves are made, where d is the number of digits in n.0, 1, 2, 3, 4, 5, 6, 7...
A358650Matula-Goebel tree number of the binomial tree of n vertices.1, 2, 4, 6, 12, 18, 42, 78...
A358670a(n) = 1 if for all factorizations of n as x*y, the sum x+y is carryfree when the addition is done in the primorial base, otherwise 0.0, 1, 0, 1, 0, 1, 0, 0...
A358671Numbers k such that for all factorizations of k as x*y, the sum x+y is carryfree when the addition is done in the primorial base, A049345.2, 4, 6, 14, 18, 24, 26, 28...
A358672a(n) = 1 if for all factorizations of n as x*y, the sum (x * y') + (x' * y) is carryfree when the addition is done in the primorial base, otherwise 0. Here u' stands for A003415(u), the arithmetic derivative of u.1, 1, 1, 1, 1, 1, 1, 0...
A358673Numbers k such that for all factorizations of k as x*y, the sum (x * y') + (x' * y) is carryfree when the addition is done in the primorial base, A049345. Here n' stands for A003415(n), the arithmetic derivative of n.1, 2, 3, 4, 5, 6, 7, 11...
A358674Numbers k for which there is a factorization of k into such a pair of natural numbers x and y, that the sum (x * y') + (x' * y) will generate at least one carry when the addition is done in the primorial base. Here n' stands for A003415(n), the arithmetic derivative of n.8, 9, 10, 15, 16, 20, 21, 22...
A358675Numbers k such that for all nontrivial factorizations of k as x*y, the sum (x * y') + (x' * y) will generate at least one carry when the addition is done in the primorial base. Here n' stands for A003415(n), the arithmetic derivative of n.8, 9, 10, 15, 16, 20, 21, 22...
A358691Gilbreath transform of primes p(2k-1); see Comments.3, 3, 3, 3, 1, 1, 1, 1...
A358692Gilbreath transform of primes p(2k) with 2 prefixed; see Comments.1, 3, 1, 1, 1, 1, 1, 1...
A358694Triangle read by rows. Coefficients of the polynomials H(n, x) = Sum_{k=0..n-1} Sum_{i=0..k} abs(Stirling1(n, n - i)) * xn - k in ascending order of powers.1, 0, 1, 0, 2, 1, 0, 6...
A358702a(n) is the least k > 0 such that the sum of the decimal digits of k2 is n, or 0 if no such k exists.1, 0, 0, 2, 0, 0, 4, 0...
A358703Sliding numbers: totals, without repetitions, of sums r + s, r >= s, such that 1/r + 1/s = (r + s)/10k for some k >= 0.2, 7, 11, 20, 25, 29, 52, 65...
A358705Zeroless pandigital numbers whose square has each digit 1 to 9 twice.345918672, 351987624, 359841267, 394675182, 429715863, 439516278, 487256193, 527394816...
A358707Number of cycles in the grid graph P_10 X P_n.45, 9779, 2577870, 439673502, 64300829449, 9203308475041, 1322310119854705, 190273063549680295...
A358712Number of self-avoiding closed paths on an n X 6 grid which pass through four corners ((0,0), (0,5), (n-1,5), (n-1,0)).1, 17, 229, 3105, 44930, 674292, 10217420, 154980130...
A358713Number of self-avoiding closed paths on an n X 7 grid which pass through four corners ((0,0), (0,6), (n-1,6), (n-1,0)).1, 41, 1081, 26515, 674292, 17720400, 471468756, 12570253556...
A358714a(n) = phi(n)3.1, 1, 8, 8, 64, 8, 216, 64...
A358723Number of n-node rooted trees of edge-height equal to their number of leaves.0, 1, 0, 2, 1, 6, 7, 26...
A358724Difference between the number of internal (non-leaf) nodes and the edge-height of the rooted tree with Matula-Goebel number n.0, 0, 0, 0, 0, 0, 0, 0...
A358725Matula-Goebel numbers of rooted trees with a greater number of internal (non-leaf) vertices than edge-height.9, 15, 18, 21, 23, 25, 27, 30...
A358726Difference between the node-height and the number of leaves in the rooted tree with Matula-Goebel number n.0, 1, 2, 0, 3, 1, 1, -1...
A358727Matula-Goebel numbers of rooted trees with greater number of leaves (width) than node-height.8, 16, 24, 28, 32, 36, 38, 42...
A358728Number of n-node rooted trees whose node-height is less than their number of leaves.0, 0, 0, 1, 1, 5, 10, 30...
A358729Difference between the number of nodes and the node-height of the rooted tree with Matula-Goebel number n.0, 0, 0, 1, 0, 1, 1, 2...
A358730Positions of first appearances in A358729 (number of nodes minus node-height).1, 4, 8, 16, 27, 54, 81, 162...
A358731Matula-Goebel numbers of rooted trees whose number of nodes is one more than their node-height.4, 6, 7, 10, 13, 17, 22, 29...
A358732Number of labeled trees covering 2n nodes, half of which are leaves.0, 12, 720, 109200, 31752000
A358738Expansion of Sum_{k>=0} k! * ( x/(1 - k*x) )k.1, 1, 3, 15, 103, 893, 9341, 114355...
A358740Expansion of Sum_{k>=0} k! * ( k * x/(1 - k*x) )k.1, 1, 9, 195, 7699, 482309, 43994741, 5508667927...
A358741Expansion of Sum_{k>=0} k! * ( k * x/(1 - x) )k.1, 1, 9, 179, 6655, 400581, 35530421, 4357960999...
A358742First of three consecutive primes p,q,r such that p3 + q3 - r3 is prime.13, 29, 89, 97, 127, 137, 151, 163...
A358743First of three consecutive primes p,q,r such that p+q-r is prime.7, 11, 13, 17, 19, 29, 41, 43...
A358747Lexicographically earliest infinite sequence such that for all i, j, a(i) = a(j) => f(i) = f(j), where f(n) = [A007814(n), A007949(n), A324198(n)] when n > 1, with f(1) = 1.1, 2, 3, 4, 5, 6, 5, 7...
A358750a(n) = 1 if A349905(n) is a multiple of 4, otherwise 0. Here A349905(n) is the arithmetic derivative applied to the prime shifted n.1, 0, 0, 0, 0, 1, 0, 0...
A358751a(n) = 1 if bigomega(n) == 1 (mod 4), otherwise 0.0, 1, 1, 0, 1, 0, 1, 0...
A358752a(n) = 1 if A349905(n) == 2 (mod 4), otherwise 0. Here A349905(n) is the arithmetic derivative applied to the prime shifted n.0, 0, 0, 1, 0, 0, 0, 0...
A358753a(n) = 1 if bigomega(n) == 3 (mod 4), otherwise 0.0, 0, 0, 0, 0, 0, 0, 1...
A358754a(n) = 1 if A053669(n) [the smallest prime not dividing n] is of the form 6m+1, otherwise a(n) = 0.0, 0, 0, 0, 0, 0, 0, 0...
A358755a(n) = 1 if A053669(n) [the smallest prime not dividing n] is of the form 6m-1, otherwise a(n) = 0.0, 0, 0, 0, 0, 1, 0, 0...
A358756Numbers k such that the smallest prime that does not divide them is of the form 6m+1.30, 60, 90, 120, 150, 180, 240, 270...
A358757Numbers k such that the smallest prime that does not divide them is of the form 6m-1.6, 12, 18, 24, 36, 42, 48, 54...
A358760Numbers k for which A349905(k) is a multiple of 4, where A349905(k) is the arithmetic derivative applied to the prime shifted k.1, 6, 15, 16, 21, 22, 26, 36...
A358761Numbers k for which bigomega(k) == 1 (mod 4).2, 3, 5, 7, 11, 13, 17, 19...
A358762Numbers k for which A349905(k) == 2 (mod 4), where A349905(k) is the arithmetic derivative applied to the prime shifted k.4, 9, 10, 14, 24, 25, 33, 34...
A358763Numbers k for which bigomega(k) == 3 (mod 4).8, 12, 18, 20, 27, 28, 30, 42...
A358764Largest difference between consecutive divisors of A276086(n), where A276086 is the primorial base exp-function.0, 1, 2, 3, 6, 9, 4, 5...
A358769a(n) = 1 if n is of the form p * m2, where p is a prime and m is a natural number >= 1, otherwise 0.0, 1, 1, 0, 1, 0, 1, 1...
A358770a(n) = 1 if n is of the form p * m2, where p is an odd prime and m is a natural number >= 1, otherwise 0.0, 0, 1, 0, 1, 0, 1, 0...
A358771a(n) = 1 if the arithmetic derivative of n is of the form 4k+1, otherwise 0.0, 0, 1, 1, 0, 1, 1, 1...
A358772Numbers whose arithmetic derivative is of the form 4k+1, cf. A003415.2, 3, 5, 6, 7, 11, 13, 14...
A358773a(n) = 1 if the arithmetic derivative of n is of the form 4k+3, otherwise 0.0, 0, 0, 0, 0, 0, 0, 0...
A358774Numbers whose arithmetic derivative is of the form 4k+3, cf. A003415.10, 26, 27, 30, 34, 45, 58, 63...
A358775a(n) = 1 if the prime factorization of n has an even number of prime factors that sum to an odd number, otherwise 0.0, 0, 0, 0, 0, 1, 0, 0...
A358776Positive integers with an even number of prime factors (counting repetitions) that sum to an odd number.6, 10, 14, 22, 24, 26, 34, 38...
A358784Size of largest semigroup generated by three n X n boolean matrices.2, 16, 440
A358785Number of cycles in the grid graph P_11 X P_n.55, 23637, 12253948, 3779989098, 975566486675, 245355064111139, 61875355046353061, 15609156135669687673...
A358791a(n) = n!*Sum_{m=0..floor(n/2)} binomial(n,2m)-1.1, 1, 4, 8, 52, 156, 1536, 6144...
A358792Numbers k such that for some r we have d(1) + ... + d(k - 1) = d(k + 1) + ... + d(k + r), where d(i) = A000005(i).3, 10, 16, 23, 24, 27, 42, 43...
A358794Number of Hamiltonian paths in P_7 X P_n.1, 44, 688, 12010, 109722, 1620034, 13535280, 175905310...
A358795Number of Hamiltonian paths in P_8 X P_n.1, 58, 1578, 38984, 602804, 12071462, 175905310, 3023313284...
A358796Number of Hamiltonian paths in P_9 X P_n.1, 74, 3190, 122188, 2434670, 82550864, 1449655468, 43551685370...
A358797Numbers r such that for some k we have d(1) + ... + d(k - 1) = d(k + 1) + ... + d(k + r), where d(i) = A000005(i).1, 6, 11, 16, 17, 19, 31, 32...
A358800Number of (undirected) paths in the grid graph P_4 X P_n.6, 146, 1618, 14248, 111030, 801756, 5493524, 36213404...
A358801Number of (undirected) paths in the grid graph P_5 X P_n.10, 373, 7119, 111030, 1530196, 19506257, 235936139, 2746052608...
A358802Number of (undirected) paths in the grid graph P_6 X P_n.15, 872, 28917, 801756, 19506257, 436619868, 9260866349, 189018035618...
A358803Number of (undirected) paths in the grid graph P_7 X P_n.21, 1929, 111360, 5493524, 235936139, 9260866349, 343715004510, 12272026383150...
A358810Number of spanning trees in C_5 X C_n.5, 16810, 10609215, 4381392020, 1562500000000, 522217835532030, 168437773747672835, 53095647535975155240...
A358811Number of spanning trees in C_6 X C_n.6, 117600, 292626432, 428652000000, 522217835532030, 587312954081280000, 633426582213424399722, 665880333340217184000000...
A358812Number of spanning trees in C_7 X C_n.7, 799694, 7839321861, 40643137651228, 168437773747672835, 633426582213424399722, 2266101334892340404752384, 7871822605982542067643202616...
A358813Number of spanning trees in C_8 X C_n.8, 5326848, 205683135000, 3771854305099776, 53095647535975155240, 665880333340217184000000, 7871822605982542067643202616, 89927963805390785392395474173952...
A358814Number of spanning trees in C_9 X C_n.9, 34928082, 5312031978672, 344499209234302500, 16463182598208445194045, 687776414074843514847584256, 26818349084747196820449212376063, 1005049441217682470864686231147005000...
A358815Number of spanning trees in C_10 X C_n.10, 226195360, 135495143785470, 31074298464967845120, 5040439500800000000000000, 701129416495732552572667500000, 90098172307754257628918141363625670, 11062145603354190616166421646710839715840...
A358816Numbers k such that d + k/d is prime for any unitary divisor d of k.1, 2, 4, 6, 10, 12, 16, 18...
A358817Numbers k such that A046660(k) = A046660(k+1).1, 2, 5, 6, 10, 13, 14, 21...
A358818a(n) is the least number k such that A046660(k) = A046660(k+1) = n.1, 44, 135, 80, 8991, 29888, 123200, 2316032...
A358819Numbers k such that for some r we have w(1) + ... + w(k - 1) = w(k + 1) + ... + w(k + r), where w(i) = A000120(i).4, 5, 8, 9, 10, 11, 12, 15...
A358823Number of odd-length twice-partitions of n into partitions with all odd parts.0, 1, 1, 3, 3, 7, 10, 20...
A358825Number of ways to choose a sequence of integer partitions, one of each part of an integer partition of n into odd parts.1, 1, 1, 4, 4, 11, 20, 35...
A358826Number of ways to choose a sequence of partitions, one of each part of an odd-length partition of 2n+1 into odd parts.1, 4, 11, 35, 113, 326, 985, 3124...
A358827Number of twice-partitions of n into partitions with all odd lengths and sums.1, 1, 1, 3, 3, 7, 11, 19...
A358828Number of twice-partitions of n with no singletons.1, 0, 1, 2, 5, 8, 19, 30...
A358829Number of twice-partitions of n with no (1)'s.1, 0, 2, 3, 9, 13, 38, 56...
A358830Number of twice-partitions of n into partitions with all different lengths.1, 1, 2, 4, 9, 15, 31, 53...
A358831Number of twice-partitions of n into partitions with weakly decreasing lengths.1, 1, 3, 6, 14, 26, 56, 102...
A358840Primorial base exp-function reduced modulo 6.1, 2, 3, 0, 3, 0, 5, 4...
A358841a(n) = 1 if A276086(n) is of the form 6k+1, where A276086 is the primorial base exp-function.1, 0, 0, 0, 0, 0, 0, 0...
A358842a(n) = 1 if A276086(n) is of the form 6k+5, where A276086 is the primorial base exp-function.0, 0, 0, 0, 0, 0, 1, 0...
A358843Numbers k such that A276086(k) == 5 (mod 6), where A276086 is the primorial base exp-function.6, 18, 36, 48, 66, 78, 96, 108...
A358844Numbers k for which A276086(6*k) == 5 (mod 6), where A276086 is the primorial base exp-function.1, 3, 6, 8, 11, 13, 16, 18...
A358845Numbers k for which A276086(6*k) == 1 (mod 6), where A276086 is the primorial base exp-function.0, 2, 4, 5, 7, 9, 10, 12...
A358846a(n) = 1 if A276086(6*n) == 5 (mod 6), otherwise 0, where A276086 is the primorial base exp-function.0, 1, 0, 1, 0, 0, 1, 0...
A358847a(n) = 1 if A053669(6n) [the smallest prime not dividing 6n] is of the form 6m-1, otherwise a(n) = 0.1, 1, 1, 1, 0, 1, 1, 1...
A358848Numbers k for which A053669(6*k) [the smallest prime not dividing 6k] is of the form 6m+1.5, 10, 15, 20, 25, 30, 40, 45...
A358849Numbers k for which A053669(6*k) [the smallest prime not dividing 6k] is of the form 6m-1.1, 2, 3, 4, 6, 7, 8, 9...
A358850Primorial base exp-function reduced modulo 12.1, 2, 3, 6, 9, 6, 5, 10...
A358852a(n) = n!Sum_{m=0..floor(n/3)} 1/(binomial(n-m,2m).1, 1, 2, 12, 32, 140, 1512, 6384...
A358853Number of Hamiltonian cycles in C_5 X C_n.390, 2930, 23580, 145210, 1045940, 6228730
A358855Number of (undirected) cycles in the graph C_5 X C_n.7298, 132089, 2183490, 34846271, 548520502, 8593998133
A358856Number of (undirected) cycles in the graph C_6 X C_n.35205, 1165194, 34846271, 995818716
A358857Least integer k in A031443 such that k*n is also in A031443, or -1 if there is no such k.2, -1, 49, -1, 2, 2, 535, -1...
A358858Least multiple m of n such that both m and m/n belong to A031443, or -1 if there is no such m.2, -1, 147, -1, 10, 12, 3745, -1...
A358866Positive integers expressible as a quotient of two terms of A014486.1, 3, 5, 6, 11, 12, 13, 14...
A358868Number of (undirected) Hamiltonian paths in the graph C_5 X C_n.18240, 287160, 2955700, 29861820, 263890620, 2271291760
A358869Number of (undirected) paths in the graph C_5 X C_n.324570, 10489660, 276182500, 6486444750, 141606011050
A358870Number of (undirected) Hamiltonian paths in the graph C_6 X C_n.73368, 2172480, 29861820, 560028096, 6632769528
A358872Number of (undirected) paths in the graph C_6 X C_n.2298906, 136547568, 6486444750, 272445788808

r/OEIS • • Sep 25 '22

New OEIS sequences - week of 09/25

7 Upvotes
OEIS numberDescriptionSequence
A354528Square array T(m,n) read by antidiagonals - see Comments for definition.0, 1, 1, 3, 5, 3, 7, 12...
A355079Irregular triangle read by rows: the first row is 1, and the n-th row (n > 1) lists the factors f of n where n/f is prime (the maximal factors of n.)1, 1, 1, 2, 1, 2, 3, 1...
A355179Expansion of e.g.f. -LambertW(x2 * (1 - exp(x)))/2.0, 0, 0, 3, 6, 10, 375, 2541...
A355180Expansion of e.g.f. -LambertW(x3 * (1 - exp(x)))/6.0, 0, 0, 0, 4, 10, 20, 35...
A355181Expansion of e.g.f. -LambertW(x2/2 * (1 - exp(x))).0, 0, 0, 3, 6, 10, 195, 1281...
A355308Expansion of e.g.f. -LambertW(x3/6 * (1 - exp(x))).0, 0, 0, 0, 4, 10, 20, 35...
A355474Square array T(m,n) = Card({ (i, j) : 1 <= i <= m, 1 <= j <= min(n, i), GCD(i, j) = 1 }), read by antidiagonals upwards.1, 2, 1, 3, 2, 1, 4, 4...
A355498a(n) = A000217(A033676(n)) * A000217(A033677(n)).1, 3, 6, 9, 15, 18, 28, 30...
A355592Positions of records in A357299: integers m such that the number of divisors whose first digit equals the first digit of m sets a new record.1, 10, 100, 108, 120, 180, 1008, 1260...
A355697a(0) = 0, a(1) = 1; for n > 1, a(n) = a(n-1) + g - 1 if a(n-1) is prime, otherwise a(n) = a(n-1) + g + 1, where g = a(n-1) - a(n-2).0, 1, 3, 4, 6, 9, 13, 16...
A355844a(n) is the number of different self-avoiding (n-1)-move routes for a king on an empty n X n chessboard.1, 12, 160, 1764, 17280, 156484, 1335984, 10899404...
A355874Expansion of e.g.f. -LambertW(x2 * log(1-x))/2.0, 0, 0, 3, 6, 20, 450, 3024...
A355884Number of circles in an n X n grid passing through at least three points.0, 0, 1, 34, 223, 997, 3402, 9141...
A355914a(n) = gcd(b(n-1),b(n)), where b(n) = A351871(n).1, 2, 1, 5, 2, 1, 1, 4...
A355915Number of ways to write n as a sum of numbers of the form 2r * 3s, where r and s are >= 0, and no summand divides another.1, 1, 1, 1, 1, 1, 1, 1...
A355916Variant of Inventory Sequence A342585 where indices are also counted (long version).0, 0, 2, 0, 0, 1, 4, 0...
A355917Variant of Inventory Sequence A342585 where indices are also counted (short version).0, 2, 0, 4, 1, 1, 0, 6...
A355993Expansion of e.g.f. -LambertW(x3 * log(1-x))/6.0, 0, 0, 0, 4, 10, 40, 210...
A355994Expansion of e.g.f. -LambertW(x2/2 * log(1-x)).0, 0, 0, 3, 6, 20, 270, 1764...
A355995Expansion of e.g.f. -LambertW(x3/6 * log(1-x)).0, 0, 0, 0, 4, 10, 40, 210...
A356000Expansion of e.g.f. -LambertW((1 - exp(2*x))/2).0, 1, 4, 25, 236, 3061, 50670, 1020881...
A356001Expansion of e.g.f. -LambertW((1 - exp(3*x))/3).0, 1, 5, 36, 379, 5461, 100476, 2250613...
A356102Intersection of A001950 and A022839.2, 13, 15, 20, 26, 31, 44, 49...
A356103Intersection of A001950 and A108958.5, 7, 10, 18, 23, 28, 34, 36...
A356104a(n) = A000201(A022839(n)).3, 6, 9, 12, 17, 21, 24, 27...
A356105a(n) = A000201(A108958(n)).1, 4, 8, 11, 14, 16, 19, 22...
A356106a(n) = A000201(A108958(n)).5, 10, 15, 20, 28, 34, 39, 44...
A356144Coefficients of the set of partition polynomials [RT] = [P][E]; i.e., coefficients of polynomials resulting from using the set of refined Eulerian polynomials, [E], of A145271 as the indeterminates of the set of permutahedra polynomials, [P], of A133314. Irregular triangle read by rows with lengths given by A000041.1, -1, 1, -1, -1, 2, -1, 1...
A356145Coefficients of the inverse refined Eulerian partition polynomials [E]{-1}, partitional inverse to A145271. Irregular triangle read by row with lengths A000041.1, 1, -1, 1, 3, -4, 1, -15...
A356146Coefficients of the partition polynomials that are binomial convolutions of the partition polynomials of A133314, the refined Euler characteristic polynomials of the permutahedra and coefficient polynomials of reciprocals of Taylor series or e.g.f.s. Irregular triangle read by rows with length given by A000041.1, 1, -3, 1, 12, -9, 1, -60...
A356334a(n) is the number of nonnegative integer solutions (x; y) with x <= y of xn+1 + yn+1 = (x+y)n.1, 3, 4, 3, 3, 3, 3, 3...
A356445a(n) is the number of times that A064440(n) occurs as the sum of proper divisors function (A001065).2, 3, 5, 7, 13, 17, 19, 23...
A356549a(n) is the number of divisors of 10n whose first digit is 1.1, 2, 3, 5, 8, 11, 15, 20...
A356556Parity of A061418.0, 1, 0, 0, 1, 1, 1, 0...
A356690Product of the prime numbers that are between 10n and 10(n+1).210, 46189, 667, 1147, 82861, 3127, 4087, 409457...
A356745a(n) is the first prime that starts a string of exactly n consecutive primes where the prime + the next prime + 1 is prime.37, 5, 283, 929, 13, 696607, 531901, 408079937...
A356774Coefficients in the power series expansion of A(x) = Sum_{n=-oo..+oo} n * xn * (1 - xn)n-2.1, 4, 7, 11, 16, 17, 29, 21...
A356775Coefficients in the power series expansion of A(x) = Sum_{n=-oo..+oo} n*(n+1)/2 * x2*n * (1 - xn)n-2.1, 1, 5, 1, 11, 1, 21, -8...
A356791Emirps p such that R(p) > p and R(p) mod p is prime, where R(p) is the reversal of p.13, 17, 107, 149, 337, 1009, 1069, 1109...
A356792Smallest number k with A355915(k) = n.1, 11, 49, 103, 179, 313, 545, 601...
A356822Irregular triangle read by rows where row n starts with n and each further term is the sum of the distinct palindromes in the concatenation of the decimal digits of preceding terms.1, 1, 12, 125, 463, 476, 483, 491...
A356880Squares that can be expressed as the sum of two powers of two (2x + 2y).4, 9, 16, 36, 64, 144, 256, 576...
A356917Irregular triangle read by rows where row n lists the Colijn-Plazzotta subtree numbers, in ascending order, of each vertex of the rooted binary tree with their tree number n.1, 1, 1, 2, 1, 1, 1, 2...
A357081Leader at step n of the THROWBACK procedure (see definition in comments).3, 4, 5, 6, 3, 7, 4, 8...
A357101Decimal expansion of the real root of x3 - 2*x2 - 2.2, 3, 5, 9, 3, 0, 4, 0...
A357102Decimal expansion of the real root of x3 + 2*x - 2.7, 7, 0, 9, 1, 6, 9, 9...
A357103Decimal expansion of the real root of x3 - 3*x - 3.2, 1, 0, 3, 8, 0, 3, 4...
A357104Decimal expansion of the real root of x3 + 3*x - 1.3, 2, 2, 1, 8, 5, 3, 5...
A357110Numbers k such that 1 + k2 * 2k + k3 * 3k is prime.2, 4, 6, 10, 12, 28, 30, 52...
A357137Maximal run-length of the n-th composition in standard order; a(0) = 0.0, 1, 1, 2, 1, 1, 1, 3...
A357138Minimal run-length of the n-th composition in standard order; a(0) = 0.0, 1, 1, 2, 1, 1, 1, 3...
A357150Primitive terms in A357148.1, 3, 5, 7, 9, 15, 16, 24...
A357156Coefficients in the power series expansion of A(x) = Sum_{n=-oo..+oo} n*(n+1)(n+2)/6 * x^(3n) * (1 - xn)n-2.1, 1, 1, 6, 1, 1, 16, 1...
A357157Coefficients in the power series expansion of A(x) = Sum_{n=-oo..+oo} n*(n+1)(n+2)(n+3)/24 * x4*n * (1 - xn)n-2.1, 1, 1, 1, 7, 1, 1, 1...
A357199Primes p such that (5*p+2)/3 is the square of a prime.2, 5, 29, 101, 173, 317, 821, 1109...
A357206Coefficients in the power series A(x) such that: xA(x)2 = Sum_{n=-oo..+oo} (-1)n * x^(n(n+1)/2) * A(x)n.1, 1, 6, 39, 267, 1949, 14927, 118517...
A357207Coefficients in the power series A(x) such that: xA(x)3 = Sum_{n=-oo..+oo} (-1)n * x^(n(n+1)/2) * A(x)n.1, 1, 7, 55, 469, 4307, 41678, 418872...
A357208Coefficients in the power series A(x) such that: xA(x)4 = Sum_{n=-oo..+oo} (-1)n * x^(n(n+1)/2) * A(x)n.1, 1, 8, 74, 758, 8412, 98605, 1201739...
A357209Coefficients in the power series A(x) such that: xA(x)5 = Sum_{n=-oo..+oo} (-1)n * x^(n(n+1)/2) * A(x)n.1, 1, 9, 96, 1150, 14981, 206426, 2959249...
A357210a(n) = Sum_{k=1..n} prime(k/gcd(n,k)).2, 4, 7, 11, 19, 22, 43, 46...
A357216Table read by antidiagonals: T(n,k) (n >= 3, k >= 0) is the number of regions in an n-gon when k internal n-gons are drawn between the n*k points that divide each side into k+1 equal parts.1, 4, 1, 13, 5, 1, 28, 17...
A357218Primes p such that T(p) - 2 is prime, where T(p) is the triangular number (A000217) with index p.5, 13, 17, 29, 37, 41, 53, 61...
A357219Primes of the form T(p) - 2 where T(p) is the triangular number (A000217) with prime index p in A357218.13, 89, 151, 433, 701, 859, 1429, 1889...
A357221Coefficients in the power series A(x) such that: xA(x) = Sum_{n=-oo..+oo} (-1)n * x^(n(n+1)) * A(x)n.1, 1, 2, 8, 26, 97, 361, 1399...
A357222Coefficients in the power series A(x) such that: xA(x)2 = Sum_{n=-oo..+oo} (-1)n * x^(n(n+1)) * A(x)n.1, 1, 3, 15, 73, 391, 2180, 12620...
A357223Coefficients in the power series A(x) such that: xA(x)3 = Sum_{n=-oo..+oo} (-1)n * x^(n(n+1)) * A(x)n.1, 1, 4, 25, 164, 1177, 8887, 69748...
A357224Coefficients in the power series A(x) such that: xA(x)4 = Sum_{n=-oo..+oo} (-1)n * x^(n(n+1)) * A(x)n.1, 1, 5, 38, 315, 2855, 27325, 272030...
A357225Coefficients in the power series A(x) such that: xA(x)5 = Sum_{n=-oo..+oo} (-1)n * x^(n(n+1)) * A(x)n.1, 1, 6, 54, 542, 5950, 69089, 834807...
A357226Coefficients in the power series A(x) such that: xA(x)6 = Sum_{n=-oo..+oo} (-1)n * x^(n(n+1)) * A(x)n.1, 1, 7, 73, 861, 11112, 151822, 2159143...
A357235Table read by antidiagonals: T(n,k) (n >= 3, k >= 0) is the number of vertices in an n-gon when k internal n-gons are drawn between the n*k points that divide each side into k+1 equal parts.3, 6, 4, 15, 8, 5, 30, 20...
A357236Number of compositions (ordered partitions) of n into distinct semiprimes.1, 0, 0, 0, 1, 0, 1, 0...
A357238Inverse Moebius transform of tribonacci numbers (A000073).0, 1, 1, 3, 4, 9, 13, 27...
A357239Inverse Moebius transform of tetranacci number (A000078).0, 0, 1, 1, 2, 5, 8, 16...
A357240Expansion of e.g.f. 2 * (exp(x) - 1) / (exp(exp(x) - 1) + 1).0, 1, 0, -2, -5, -4, 32, 225...
A357241a(n) is the number of j in the range 1 <= j <= n such that j / rad(j) = n / rad(n).1, 2, 3, 1, 4, 5, 6, 1...
A357242Number of n node tournaments that have exactly two circular triads.24, 240, 2240, 21840, 228480, 2580480, 31449600, 412473600...
A357243E.g.f. satisfies A(x)A(x) = 1/(1 - x)1 - x.1, 1, -2, 6, -52, 540, -7608, 129304...
A357244E.g.f. satisfies A(x) * log(A(x)) = 2 * (exp(x) - 1).1, 2, -2, 22, -266, 4614, -102442, 2777030...
A357245E.g.f. satisfies A(x) * log(A(x)) = 3 * (exp(x) - 1).1, 3, -6, 84, -1599, 42906, -1477716, 62171661...
A357246E.g.f. satisfies A(x) * log(A(x)) = (1-x) * (exp(x) - 1).1, 1, -2, 5, -49, 497, -6926, 116510...
A357247E.g.f. satisfies A(x) * log(A(x)) = x * exp(-x).1, 1, -3, 13, -103, 1241, -19691, 384805...
A357249a(n) = A139315(n)*n.2, 6, 24, 60, 360, 840, 10080, 7560...
A357250Number of quaternary steady words of length n (with respect to the permutations of symbols).1, 2, 3, 5, 5, 7, 9, 12...
A357253a(n) is the largest prime < 6*n.5, 11, 17, 23, 29, 31, 41, 47...
A357254Table read by antidiagonals: T(n,k) (n >= 3, k >= 0) is the number of edges in an n-gon when k internal n-gons are drawn between the n*k points that divide each side into k+1 equal parts.3, 9, 4, 27, 12, 5, 57, 36...
A357258a(n) is the smallest prime p such that the minimum number of divisors among the numbers between p and NextPrime(p) is n, or -1 if no such prime exists.3, 5, 12117359, 11, 7212549413159, 29, 42433, 7207...
A357259a(n) is the number of 2 X 2 Euclid-reduced matrices having determinant n.1, 2, 3, 5, 5, 8, 7, 11...
A357260a(n) is the number of 2 X 2 Euclid-reduced matrices having coprime elements and determinant n.1, 2, 3, 4, 5, 8, 7, 9...
A357265Expansion of e.g.f. -LambertW(x * log(1-x)).0, 0, 2, 3, 32, 150, 1884, 16380...
A357267Expansion of e.g.f. -LambertW(x * (1 - exp(x))).0, 0, 2, 3, 28, 125, 1506, 12607...
A357273Integers m whose decimal expansion is a prefix of the concatenation of the divisors of m.1, 11, 12, 124, 135, 1111, 1525, 13515...
A357274List of primitive triples for integer-sided triangles with angles A < B < C and C = 2*Pi/3 = 120 degrees.3, 5, 7, 7, 8, 13, 5, 16...
A357275Smallest side of integer-sided primitive triangles whose angles satisfy A < B < C = 2*Pi/3.3, 7, 5, 11, 7, 13, 16, 9...
A357299a(n) is the number of divisors of n whose first digit equals the first digit of n.1, 1, 1, 1, 1, 1, 1, 1...
A357301a(n) is the number of distinct radii of circles passing through at least three points in a square grid of n X n points.0, 1, 7, 19, 48, 112, 212, 383...
A357307a(0) = 1, a(1) = 0, a(2) = 1; a(n) = a(n-1) + Sum_{k=0..n-3} a(k) * a(n-k-3).1, 0, 1, 2, 2, 4, 8, 13...
A357308a(0) = a(1) = 0, a(2) = 1; a(n) = a(n-1) + Sum_{k=0..n-3} a(k) * a(n-k-3).0, 0, 1, 1, 1, 1, 1, 2...
A357309Number of ascent sequences of length 2n with n zeros.1, 1, 6, 54, 660, 10255, 193732, 4312980...
A357310a(n) is the number of j in the range 1 <= j <= n with the same maximal exponent in prime factorization as n.1, 1, 2, 1, 3, 4, 5, 1...
A357311Number of partitions of n into divisors of n that are smaller than sqrt(n).1, 0, 1, 1, 1, 1, 4, 1...
A357312Number of compositions (ordered partitions) of n into divisors of n that are smaller than sqrt(n).1, 0, 1, 1, 1, 1, 13, 1...
A357313a(n) is the unique number m such that A001065(m) = A057709(n).4, 9, 8, 15, 14, 21, 121, 289...
A357319Decimal expansion of 6PiGamma(2/3)2/(sqrt(3)*Gamma(1/3)4).3, 8, 7, 4, 3, 8, 2, 3...
A357320Decimal expansion of 8PiGamma(1/2)2/Gamma(1/4)4.4, 5, 6, 9, 4, 6, 5, 8...
A357321Expansion of e.g.f. -LambertW(log(1 - 2*x)/2).0, 1, 4, 29, 308, 4349, 77094, 1650893...
A357322Expansion of e.g.f. -LambertW(log(1 - 3*x)/3).0, 1, 5, 45, 586, 10024, 213084, 5428072...
A357323Numbers k such that k and k+2 are both unitary untouchable numbers (A063948).2, 3, 5, 30756, 34182, 46128, 51816, 56352...
A357324Numbers k such that there is a unique m for which the sum of the aliquot unitary divisors of m (A034460) is k.6, 9, 11, 13, 128, 150, 164, 222...
A357325a(n) is the unique number m such that A034460(m) = A357324(n).6, 15, 21, 35, 250, 138, 4192, 10048...
A357326Weird untouchable numbers.836, 7192, 7912, 12670, 13510, 16030, 16310, 16870...
A357327a(n) is the unique nonnegative integer k <= A058084(n)/2 such that binomial(A058084(n),k) = n.0, 1, 1, 1, 1, 2, 1, 1...
A357330Decimal expansion of sigma(N) / (N * log(log(N))) for N = 5040, where sigma = A000203.1, 7, 9, 0, 9, 7, 3, 3...
A357331Decimal expansion of sigma(N) / (exp(gamma) * N * log(log(N))) for N = 5040, where sigma = A000203 and gamma = A001620 is the Euler-Mascheroni constant.1, 0, 0, 5, 5, 5, 8, 9...
A3573322-adic valuation of A000793(n).0, 1, 0, 2, 1, 1, 2, 0...
A357333E.g.f. satisfies A(x) = -log(1 - x) * exp(2 * A(x)).0, 1, 5, 50, 778, 16604, 451668, 14947568...
A357334E.g.f. satisfies A(x) = -log(1 - x) * exp(3 * A(x)).0, 1, 7, 101, 2286, 71064, 2815812, 135719352...
A357335E.g.f. satisfies A(x) = (exp(x) - 1) * exp(2 * A(x)).0, 1, 5, 49, 757, 16081, 435477, 14345297...
A357336E.g.f. satisfies A(x) = (exp(x) - 1) * exp(3 * A(x)).0, 1, 7, 100, 2257, 70021, 2768740, 133164109...
A357337E.g.f. satisfies A(x) = log(1 + x) * exp(2 * A(x)).0, 1, 3, 26, 334, 5964, 135228, 3729872...
A357338E.g.f. satisfies A(x) = log(1 + x) * exp(3 * A(x)).0, 1, 5, 65, 1302, 35904, 1260372, 53796168...
A357343E.g.f. satisfies A(x) = -log(1 - x * exp(A(x))) * exp(A(x)).0, 1, 5, 53, 878, 19904, 573984, 20112770...
A357344E.g.f. satisfies A(x) = -log(1 - x * exp(A(x))) * exp(2 * A(x)).0, 1, 7, 104, 2422, 77304, 3141108, 155155580...
A357345E.g.f. satisfies A(x) = -log(1 - x * exp(A(x))) * exp(3 * A(x)).0, 1, 9, 173, 5226, 216564, 11429592, 733443990...
A357346E.g.f. satisfies A(x) = (exp(x * exp(A(x))) - 1) * exp(A(x)).0, 1, 5, 52, 849, 18996, 540986, 18726247...
A357347E.g.f. satisfies A(x) = (exp(x * exp(A(x))) - 1) * exp(2 * A(x)).0, 1, 7, 103, 2385, 75756, 3064239, 150689953...
A357348E.g.f. satisfies A(x) = (exp(x * exp(A(x))) - 1) * exp(3 * A(x)).0, 1, 9, 172, 5181, 214196, 11279542, 722242795...
A357349E.g.f. satisfies A(x) = log(1 + x * exp(A(x))) * exp(A(x)).0, 1, 3, 23, 278, 4624, 98064, 2530142...
A357350E.g.f. satisfies A(x) = log(1 + x * exp(A(x))) * exp(2 * A(x)).0, 1, 5, 62, 1210, 32464, 1109988, 46159364...
A357351E.g.f. satisfies A(x) = log(1 + x * exp(A(x))) * exp(3 * A(x)).0, 1, 7, 119, 3186, 117204, 5493672, 313159146...

r/OEIS • • Sep 03 '22

Cool graphs pt 2

Thumbnail
oeis.org
7 Upvotes

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 06 '23

Sequences with cool graphs

6 Upvotes

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