r/OEIS • • May 10 '23

ε in a sequence?

0 Upvotes

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

ε, ε, 8, ε

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

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

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


r/OEIS • • Aug 27 '22

Question What is your favorite property of A000027 (the positive integers)?

2 Upvotes

Aside from A000045 (the fibonacci numbers) A000027 does a LOT. So what is an interesting or complex problem whose answer is the positive integers?


r/OEIS • • Jul 20 '16

Legal Documents

Thumbnail oeis.org
0 Upvotes

r/OEIS • • Nov 06 '22

New OEIS sequences - week of 11/06

2 Upvotes
OEIS numberDescriptionSequence
A355553Number of ways to select 3 or more collinear points from an n X n grid.0, 0, 8, 54, 228, 708, 1980, 4890...
A355930Sum of the prime indices of n minus the sum of the prime indices of the smallest number with same prime signature as n, when the sum is taken with multiplicity, as in A056239.0, 0, 1, 0, 2, 0, 3, 0...
A356163a(n) = 1 if sum of prime factors of n (taken with multiplicity) is even, otherwise 0.1, 1, 0, 1, 0, 0, 0, 1...
A356170a(n) = 1 if A001222(n) == 2*A007814(n), and otherwise 0, where A001222 is bigomega (number of prime factors with multiplicity) and A007814 is the 2-adic valuation of n.1, 0, 0, 0, 0, 1, 0, 0...
A356299a(n) = gcd(A276086(n), A342001(n)), where A276086 is the primorial base exp-function, and A342001 is the arithmetic derivative without its inherited divisor.2, 1, 1, 1, 1, 5, 1, 3...
A356302The least k >= 0 such that n and A276086(n+k) are relatively prime, where A276086 is the primorial base exp-function.0, 0, 0, 3, 0, 0, 0, 0...
A356303The least k >= 0 such that n and A276086(n-k) are relatively prime, where A276086 is the primorial base exp-function.0, 0, 0, 2, 0, 0, 0, 0...
A356304The least k >= 0 such that A003415(n) and A276086(n+k) are relatively prime, where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.0, 0, 0, 0, 24, 0, 4, 3...
A356305The least k >= 0 such that A003415(n) and A276086(n-k) are relatively prime, where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.0, 1, 0, 0, 0, 0, 1, 0...
A356309The least j >= n such that n and A276086(j) are relatively prime, where A276086 is the primorial base exp-function.0, 1, 2, 6, 4, 5, 6, 7...
A356310a(n) = 1 if A003415(n) and A276086(n) are relatively prime, otherwise 0. Here A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.1, 0, 1, 1, 1, 1, 0, 1...
A356311Numbers k for which A003415(k) and A276086(k) are relatively prime, where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.0, 2, 3, 4, 5, 7, 10, 11...
A356312Numbers k such that A003415(k) and A276086(k) are not relatively prime, where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.1, 6, 8, 9, 14, 15, 20, 21...
A356313a(n) = 1 if {the least k >= n such that n and A276086(k) are coprime} is one of the primorial numbers (A002110), otherwise 0.0, 1, 1, 1, 0, 0, 1, 0...
A356314Positions of primorial numbers (A002110) in A356309.1, 2, 3, 6, 10, 15, 20, 25...
A356315a(n) = 1 if n divides the least j >= n such that n and A276086(j) are coprime, otherwise 0. Here A276086 is the primorial base exp-function.1, 1, 1, 1, 1, 1, 1, 1...
A356316Numbers k such that k divides the least j >= k for which k and A276086(j) are coprime, where A276086 is the primorial base exp-function.1, 2, 3, 4, 5, 6, 7, 8...
A356317Numbers k such that k does not divide the least j >= k for which k and A276086(j) are coprime, where A276086 is the primorial base exp-function.9, 20, 21, 25, 27, 33, 39, 40...
A356318Numbers k such that the least j >= k for which k and A276086(j) are coprime is a nontrivial multiple of k, where A276086 is the primorial base exp-function.3, 10, 15, 35, 42, 70, 77, 105...
A356319Numbers k such that {the least j >= k for which k and A276086(k+j) are coprime} is larger than 0, but less than k, where A276086 is the primorial base exp-function.9, 20, 21, 25, 27, 33, 39, 40...
A356544Number of strict closure operators on a set of n elements such that all pairs of nonempty disjoint closed sets can be separated by clopen sets.0, 1, 4, 35, 857
A356693Decimal expansion of the constant B(2) = Sum_{n>=1} Sum_{m>=n+1} 1/(z(n)*z(m))2 where z(n) is the imaginary part of the n-th nontrivial zero of the Riemann zeta function.0, 0, 0, 2, 4, 8, 3, 3...
A356833Primes p such that the minimum number of divisors among the numbers between p and NextPrime(p) is a square.5, 13, 19, 31, 37, 43, 53, 61...
A356835Coordination sequence of the {4,3,5} hyperbolic honeycomb.1, 6, 30, 126, 498, 1982, 7854, 31014...
A356836Coordination sequence of the {5,3,4} hyperbolic honeycomb.1, 12, 102, 812, 6402, 50412, 396902, 3124812...
A356837Coordination sequence of the {3,5,3} hyperbolic honeycomb.1, 20, 260, 3212, 39470, 484760, 5953532, 73117640...
A356891a(n) = a(n-1) * a(n-2) + 1 if n is even, otherwise a(n) = a(n-3) + 1, with a(0) = a(1) = 1.1, 1, 2, 2, 5, 3, 16, 6...
A357131Numbers m such that A010888(m) = A031347(m) = A031286(m) = A031346(m); only the least of the anagrams are considered.0, 137, 11126, 111134, 111278, 1111223, 11111447, 111112247...
A357143a(n) is sum of the base-5 digits of n each raised to the number of digits of n in base 5.1, 2, 3, 4, 1, 2, 5, 10...
A357170Primes p such that the minimum number of divisors among the numbers between p and NextPrime(p) is a prime power.3, 5, 7, 13, 19, 23, 29, 31...
A357175Primes p such that the minimum of the number of divisors among the numbers between p and NextPrime(p) is a cube.29, 41, 101, 137, 229, 281, 349, 439...
A357190a(n) is the least prime p such that A234575(p, A007953(p)) is the n-th power of a prime.17, 13, 131, 107, 383, 613, 43607, 1021...
A357211a(n) is the real cube root of the value of the j-function for the n-th Heegner number A003173(n).12, 20, 0, -15, -32, -96, -960, -5280...
A357269Maximum number of stable matchings in the stable marriage problem of order n.1, 2, 3, 10, 16
A357271Lower bounds for the maximum number of stable matchings in the stable marriage problem based on composing smaller instances.1, 2, 3, 10, 16, 48, 71, 268...
A357294Number of integral quantales on n elements, up to isomorphism.1, 1, 2, 9, 49, 364, 3335, 37026...
A357295Number of balanced quantales on n elements, up to isomorphism.1, 1, 9, 106, 1597, 29720, 663897, 17747907...
A357376The lowest number on Ulam Spiral for which all numbers in the square which is centered at a(n) and spans n-1 spaces in each cardinal direction are nonprime.1, 26, 1016, 5136, 39639, 203100, 2729736, 32264250...
A357408a(n) is the least sum n + y such that 1/n + 1/y = 1/z with gcd(n,y,z) = 1, for some integers y and z.4, 9, 16, 25, 9, 49, 64, 81...
A357442Consider a clock face with 2*n "hours" maked around the dial; a(n) = number of ways to match the even hours to the odd hours, modulo rotations and reflections.1, 1, 3, 5, 17, 53
A357470Decimal expansion of the real root of x3 - x2 - 2*x - 1.2, 1, 4, 7, 8, 9, 9, 0...
A357471Decimal expansion of the real root of x3 - x2 + 2*x - 1.5, 6, 9, 8, 4, 0, 2, 9...
A357472Decimal expansion of the real root of x3 + x2 + 2*x - 1.3, 9, 2, 6, 4, 6, 7, 8...
A357489Numbers k such that the k-th composition in standard order is a triple (w,x,y) such that 2w = 3x + 4y.133, 1034, 4113, 8212, 32802, 65576, 131137, 262212...
A357528Decimal expansion of Sum_{j>=1} 1/A031926(j)2.0, 0, 0, 1, 8, 3, 9, 3...
A357602a(n) is the number of n-gons in A000940 that are asymmetric.0, 0, 0, 1, 15, 121, 1026, 8696...
A357734Array T(n,k), read by descending antidiagonals, whose rows are numbers congruent to p or q mod r, with 0 <= p < q < r, sorted by r, then p, then q.0, 1, 0, 2, 1, 0, 3, 3...
A357849Number of integer partitions (w,x,y) summing to n such that 2w = 3x + 4y.0, 0, 0, 0, 0, 0, 0, 0...
A357891a(1) = 1; a(n+1) is the smallest integer > 0 that cannot be obtained from the integers {a(1), ..., a(n)} using each number exactly once and the operators +, -, *, /.1, 2, 4, 11, 34, 152, 1079, 6610...
A357938Inverse Moebius transform of n * 2omega(n).1, 5, 7, 13, 11, 35, 15, 29...
A357956a(n) = 5A005259(n) - 2A005258(n).3, 19, 327, 6931, 162503, 4072519, 107094207, 2919528211...
A357957a(n) = A005259(n)5 - A005258(n)2.0, 3116, 2073071232, 6299980938881516, 39141322964380888600000, 368495989505416178203682748116, 4552312485541626792249211584618373944, 68109360474242016374599574592870648425552876...
A357958a(n) = 5A005259(n) + 14A005258(n-1).39, 407, 7491, 167063, 4112539, 107461667, 2923006251, 81853622423...
A357959a(n) = 5A005259(n-1) + 2A005258(n).11, 63, 659, 9727, 187511, 4304943, 109312739, 2941124607...
A357960a(n) = A005259(n-1)5 * A005258(n)6.729, 147018378125, 20917910914764786689697, 24148107115850058575342740485778125, 79477722547796770983047586179643766765851375729, 492664048531500749211923278756418311980637289373757041378125, 4671227340507161302417161873394448514470099313382652883508175438056640625
A358027Expansion of g.f.: (1 + x - 2x2 + 2x4)/((1-x)(1-3x2)).1, 2, 3, 6, 11, 20, 35, 62...
A358035a(n) = (8n3 + 12n2 + 4*n - 9)/3.5, 37, 109, 237, 437, 725, 1117, 1629...
A358036Number of n-step self-avoiding walks on a 2D square lattice where the first visited lattice point is directly visible from the last visited lattice point, and were both the visited lattice points and the path between these points are considered when determining the visibility of points.0, 8, 24, 48, 144, 336, 992, 2344...
A358042Partial sums of A071619.0, 1, 4, 10, 21, 38, 62, 95...
A358046Number of n-step self-avoiding walks on a 2D square lattice where the first visited lattice point is directly visible from the last visited lattice point, and were only visited lattice points are considered when determining the visibility of points.4, 8, 32, 64, 240, 480, 1904, 3832...
A358050Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} binomial(kj,j) * binomial(k(n-j),n-j).1, 1, 0, 1, 2, 0, 1, 4...
A358052Triangular array read by rows. For T(n,k) where 1 <= k <= n, start with x = k and repeat the map x -> floor(n/x) + (n mod x) until an x occurs that has already appeared. The number of applications of the map is T(n,k).1, 2, 2, 2, 1, 2, 2, 1...
A358066Inventory sequence: record where the 1's, 2's, etc. are located starting with a(1) = 1, a(2) = 1 (see example).1, 1, 1, 2, 1, 2, 3, 4...
A358067a(n) is the smallest m such that A144261(m) = n.1, 15, 14, 33, 22, 17, 73, 49...
A358072a(n) is the number of "merger histories" of n elements (see A256006) where at most 3 elements can merge at the same time.1, 1, 4, 28, 320, 5360, 123760, 3765440...
A358082a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not previously occurring that shares a factor with Sum_{k=1..n-1} sigma(a(k)).1, 2, 4, 11, 23, 47, 5, 101...
A358083Sum of square end-to-end displacements over all n-step self-avoiding walks of A358046.4, 16, 128, 448, 2256, 5376, 29424, 69888...
A358084Sum of square end-to-end displacements over all n-step self-avoiding walks of A358036.0, 16, 88, 288, 1104, 3264, 12032, 34144...
A358085Inventory of positions ordered by binary lengths of terms, as an irregular table; the first row contains 1, subsequent rows contains the 1-based positions of terms with binary length 1, followed by positions of terms with binary length 2, 3, etc. in prior rows flattened.1, 1, 1, 2, 1, 2, 3, 4...
A358086Inventory of positions ordered by odd parts of terms, as an irregular table; the first row contains 1, subsequent rows contains the 1-based positions of terms with odd part 1, followed by positions of terms with odd part 3, 5, etc. in prior rows flattened.1, 1, 1, 2, 1, 2, 3, 4...
A358089First differences of A126706.6, 2, 4, 4, 8, 4, 4, 1...
A358090Partial inventory of positions as an irregular table; rows 1 and 2 contain 1, for n > 2, row n contains the 1-based positions of 1's, followed by the positions of 2's, 3's, etc. in rows n-2 and n-1 flattened.1, 1, 1, 2, 1, 2, 3, 1...
A358094a(n) is the number of ways n can be reached in the following method: we start with 1, then add or multiply alternately, and each operand must be 2 or 3.1, 1, 2, 2, 2, 2, 0, 3...
A358097a(n) is the smallest integer m > n such that m and n have no common digit, or -1 when such integer m does not exist.1, 2, 3, 4, 5, 6, 7, 8...
A358099a(n) is the number of divisors of n whose digits are in strictly decreasing order (A009995).1, 2, 2, 3, 2, 4, 2, 4...
A358100a(n) is the smallest integer that has exactly n divisors whose decimal digits are in strictly decreasing order.1, 2, 4, 6, 12, 20, 30, 40...
A358101Positions of records in A358099, i.e., integers whose number of divisors whose decimal digits are in strictly decreasing order sets a new record.1, 2, 4, 6, 12, 20, 30, 40...
A358102Numbers of the form prime(w)*prime(x)*prime(y) with w >= x >= y such that 2w = 3x + 4y.66, 153, 266, 609, 806, 1295, 1599, 1634...
A358103Quotient of the n-th divisible pair, where pairs are ordered by Heinz number. Quotient of prime indices of A318990(n).1, 2, 1, 3, 4, 2, 5, 1...
A358104Unreduced numerator of the n-th divisible pair, where pairs are ordered by Heinz number. Greater prime index of A318990(n).1, 2, 2, 3, 4, 4, 5, 3...
A358105Unreduced denominator of the n-th divisible pair, where pairs are ordered by Heinz number. Lesser prime index of A318990(n).1, 1, 2, 1, 1, 2, 1, 3...
A358106Quotient of the n-th divisible pair, where pairs are ordered first by sum and then by denominator.1, 2, 3, 1, 4, 5, 2, 1...
A358120Partial inventory of positions as an irregular table; rows 1 and 2 contain 1, for n > 2, row n contains the 1-based positions of 1's, followed by the positions of 2's, 3's, etc. in rows n-1 and n-2 flattened.1, 1, 1, 2, 1, 3, 2, 1...
A358121Distinct values of A358085, in order of appearance.1, 2, 3, 4, 5, 6, 7, 8...
A358122Distinct values of A358086, in order of appearance.1, 2, 3, 4, 5, 6, 8, 7...
A358123Distinct values of A358090, in order of appearance.1, 2, 3, 4, 5, 6, 7, 8...
A358124Distinct values of A358120, in order of appearance.1, 2, 3, 4, 5, 6, 8, 7...
A358127a(n) is the cardinality of the set of pairwise gcd's of {prime(1)+1, ..., prime(n)+1}.1, 3, 4, 5, 5, 5, 5, 7...
A358129Lexicographically earliest sequence of distinct nonnegative integers on a square spiral such that no number shares a digit with any of its four orthogonally adjacent neighbors.0, 1, 2, 3, 4, 5, 6, 7...
A358133Triangle read by rows whose n-th row lists the first differences of the n-th composition in standard order (row n of A066099).0, -1, 1, 0, 0, -2, 0, -1...
A358134Triangle read by rows whose n-th row lists the partial sums of the n-th composition in standard order (row n of A066099).1, 2, 1, 2, 3, 2, 3, 1...
A358135Difference of first and last parts of the n-th composition in standard order.0, 0, 0, 0, -1, 1, 0, 0...
A358136Irregular triangle read by rows whose n-th row lists the partial sums of the prime indices of n (row n of A112798).1, 2, 1, 2, 3, 1, 3, 4...
A358137Heinz number of the partial sums of the prime indices of n.1, 2, 3, 6, 5, 10, 7, 30...
A358138Difference between maximum and minimum part in the n-th composition in standard order.0, 0, 0, 0, 1, 1, 0, 0...
A358140Inverse permutation to A358121.1, 2, 3, 4, 5, 6, 7, 8...
A358141Inverse permutation to A358122.1, 2, 3, 4, 5, 6, 8, 7...
A358142Inverse permutation to A358123.1, 2, 3, 4, 5, 6, 7, 8...
A358143Inverse permutation to A358124.1, 2, 3, 4, 5, 6, 8, 7...
A358144Number of strict closure operators on a set of n elements such that all pairs of distinct points can be separated by clopen sets.0, 0, 1, 16, 1067
A358145a(n) = Sum_{k=0..n} binomial(nk,k) * binomial(n(n-k),n-k).1, 2, 16, 258, 6184, 195660, 7674144, 358788696...
A358146Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} binomial(k*j,j).1, 1, 1, 1, 2, 1, 1, 3...
A358147Primes p such that the polynomial x7 - 7*x + 3 (mod p) is the product of seven linear factors.1879, 5381, 5783, 8819, 8893, 12007, 12917, 13967...
A358150Squares visited by a knight moving on a square-spiral numbered board where the knight moves to the smallest numbered unvisited square and where the square number is more than the number of currently visited squares.1, 10, 3, 6, 9, 12, 15, 18...
A358152Number of strict closure operators on a set of n elements such that every point and every set disjoint from that point can be separated by clopen sets.1, 1, 2, 8, 121
A358153Lexicographically earliest infinite sequence of distinct positive integers on a square spiral such that each number shares a factor with its four orthogonally nearest neighbors but shares no factor with its four diagonal next-nearest neighbors.6, 10, 35, 21, 77, 22, 143, 39...
A358157a(n) is the permanent of the n X n matrix M(n) that is defined by M[i,j] = floor(i*j/3).1, 0, 0, 1, 32, 1422, 146720, 18258864...
A358158a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i,j] = floor(i*j/3).1, 0, 4, 238, 31992, 9390096
A358159a(n) is the permanent of the n X n matrix M(n) that is defined by M[i,j] = ij - floor(ij/3).1, 1, 7, 102, 4396, 374216, 49857920, 11344877568...
A358160a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i,j] = ij - floor(ij/3).1, 2, 40, 3884, 1016376, 534983256
A358161a(n) is the permanent of the n X n matrix M(n) that is defined by M[i,j] = ceiling(i*j/3).1, 1, 3, 19, 434, 18142, 1138592, 131646240...
A358162a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i,j] = ceiling(i*j/3).1, 1, 11, 530, 71196, 18680148
A358163a(n) is the permanent of the n X n matrix M(n) that is defined by M[i,j] = ij - ceiling(ij/3).1, 0, 1, 30, 1272, 113224, 18615680, 4299553536...
A358164a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i,j] = ij - ceiling(ij/3).1, 1, 26, 2704, 698568, 384890688
A358165Irregular triangular array read by rows. T(n,k) is the number of direct sum decompositions V_1 + V_2 + ... + V_m = GF(2)n with the dimensions of the V_i corresponding to the kth partition of n in canonical ordering, n>=0, 1<=k<=A000041(n).1, 1, 1, 3, 1, 28, 28, 1...
A358168First n-digit number to occur in Van Eck's Sequence (A181391).0, 14, 131, 1024, 10381, 100881, 1014748, 10001558...
A358169Row n lists the first differences plus one of the prime indices of n with 1 prepended.1, 2, 1, 1, 3, 1, 2, 4...
A358173First differences of A286708.36, 28, 8, 36, 52, 4, 16, 9...
A358174Smaller of a pair of numbers (m, m+1) such that both are products P of composite prime powers with omega(P) > 1.675, 9800, 235224, 465124, 1825200, 11309768, 384199200, 592192224...
A358175a(1) = 1, a(2) = 2; a(3) = 3; for n > 3, a(n) is the smallest positive number not previously occurring that shares a factor with Sum_{k=1..n-1} A001065(a(k)), where A001065(m) is the sum of the proper divisors of m.1, 2, 3, 4, 5, 6, 8, 19...
A358176a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not previously occurring that shares a factor with sigma(a(n-1)).1, 2, 3, 4, 7, 6, 8, 5...
A358177Number of Eulerian orientations of a (labeled) 2n-dimensional hypercube graph, Q_2n. Q_2n is also the n-dimensional torus grid graph (C_4)n.1, 2, 2970, 351135773356461511142023680
A358180Indices for A358168.1, 30, 162, 1150, 11603, 104511, 1041245, 10226995...
A358191Decimal expansion of Sum_{n >= 2} (n-1)/(nn).3, 3, 7, 1, 8, 7, 7, 1...
A358192Numerator of the quotient of the prime indices of the n-th semiprime.1, 1, 1, 1, 1, 2, 1, 1...
A358193Denominator of the quotient of the prime indices of the n-th semiprime.1, 2, 1, 3, 4, 3, 2, 5...
A358196Numbers k such that 5k and 8k have the same leading digit.0, 5, 9, 15, 19, 29, 34, 39...
A358201a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not previously occurring that shares a factor with sigma(max_{k=1..n-1}a(k)).1, 2, 3, 4, 7, 6, 8, 5...
A358203Decimal expansion of Sum_{n >= 1} 1/(2*n)n.5, 6, 7, 3, 8, 4, 1, 1...
A358204Decimal expansion of Sum_{n >= 1} (-1)n+1/(2*n)n.4, 4, 1, 8, 9, 5, 1, 6...
A358205a(n) is the least number k such that 1 + 2k + 3k2 has exactly n prime divisors, counted with multiplicity.0, 2, 1, 13, 19, 7, 61, 331...
A358213Positions of records in A356302.0, 3, 10, 35, 77, 286, 2431, 4199...
A358214Record values in A356302.0, 3, 20, 175, 2233, 29744, 508079, 9695491...
A358217Number of prime factors (with multiplicity) in A319627(n).0, 0, 1, 0, 1, 0, 1, 0...
A358218Number of prime factors (with multiplicity) in A328478(n).0, 0, 1, 0, 1, 0, 1, 0...
A358219Indices k where A358217(k) != A358218(k).15, 35, 45, 70, 75, 77, 105, 135...
A358239Numbers k such that the aliquot sequence of 2k ends with the prime 3.2, 4, 55, 164, 305, 317
A358252a(n) is the least number with exactly n non-unitary square divisors.1, 8, 32, 128, 288, 864, 1152, 2592...
A358253Numbers with a record number of non-unitary square divisors.1, 8, 32, 128, 288, 864, 1152, 2592...
A358254Lexicographically earliest sequence of distinct nonnegative integers on a square spiral such that the sum of the eight numbers around any chosen number ends in the chosen number.0, 1, 2, 3, 4, 5, 6, 7...
A358255Primitive Niven numbers ending with zero.110, 140, 150, 190, 220, 230, 280, 320...
A358256a(n) is the smallest primitive Niven number ending with n zeros.1, 110, 1300, 17000, 790000, 59900000, 19999999000000, 2999999999999990000000...
A358258First n-bit number to appear in Van Eck's sequence (A181391).0, 2, 6, 9, 17, 42, 92, 131...
A358259Positions of the first n-bit number to appear in Van Eck's sequence (A181391).1, 5, 10, 24, 41, 52, 152, 162...
A358260a(n) is the number of infinitary square divisors of n.1, 1, 1, 2, 1, 1, 1, 2...
A358261a(n) is the number of noninfinitary square divisors of n.0, 0, 0, 0, 0, 0, 0, 0...
A358262a(n) is the least number with exactly n noninfinitary square divisors.1, 16, 144, 256, 3600, 1296, 2304, 65536...
A358263Numbers with a record number of noninfinitary square divisors.1, 16, 144, 256, 1296, 2304, 20736, 57600...
A358264Expansion of e.g.f. 1/(1 - x * exp(x2/2)).1, 1, 2, 9, 48, 315, 2520, 23415...
A358265Expansion of e.g.f. 1/(1 - x * exp(x3/6)).1, 1, 2, 6, 28, 160, 1080, 8470...
A358266Numbers k such that the aliquot sequence of 2k ends with the prime 7.3, 10, 12, 141, 278, 387, 421

r/OEIS • • Nov 20 '22

New OEIS sequences - week of 11/20

2 Upvotes
OEIS numberDescriptionSequence
A355459Real part of the Heighway/harter dragon curve points which are on the real axis.0, 1, -2, -3, -4, -5, 6, 7...
A355460Imaginary part of the Heighway/Harter dragon curve points which are on the imaginary axis.0, 1, 2, -3, -4, -5, -6, -9...
A356219Intersection of A001952 and A003151.284, 287, 289, 292, 294, 296, 299, 301...
A356220a(n) = A108598(A001950(n)).3, 9, 12, 18, 23, 27, 32, 36...
A356256The lesser of the 2n-th twin prime pair (A001359).3, 5, 17, 71, 227, 821, 2087, 5021...
A356568a(n) = (4n - 1)n^(2n).0, 3, 240, 45927, 16711680, 9990234375, 8913923665920, 11111328602485167...
A356585Number of decimal digits in the n-th Gosper hyperfactorial of n (A330716).1, 1, 2, 16, 198, 2927, 50060, 979361...
A356586Number of binary digits in the n-th Gosper hyperfactorial of n (A330716).1, 1, 5, 51, 657, 9722, 166296, 3253365...
A357070Number of partitions of n into at most 2 distinct positive triangular numbers.1, 1, 0, 1, 1, 0, 1, 1...
A357071Number of partitions of n into at most 3 distinct positive triangular numbers.1, 1, 0, 1, 1, 0, 1, 1...
A357072Number of partitions of n into at most 4 distinct positive triangular numbers.1, 1, 0, 1, 1, 0, 1, 1...
A357263Numbers k such that the sum of the distinct digits of k is equal to the product of the prime divisors of k.1, 2, 3, 5, 6, 7, 24, 343...
A357417Row sums of the triangular array A357431.1, 5, 12, 27, 43, 76, 109, 168...
A357431Triangle read by rows where each term in row n is the next greater multiple of n..1.1, 2, 3, 3, 4, 5, 4, 6...
A357473Number of types of generalized symmetries in diagonal Latin squares of order n1, 0, 0, 10, 8, 12, 12
A357474Squarely correct numbers.1, 4, 9, 11, 14, 16, 19, 25...
A357514Minimum number of transversals in an orthogonal diagonal Latin square of order n.1, 0, 0, 8, 15, 0, 23, 16...
A357516Number of snake-like polyominoes in an n X n square that start at the NW corner and end at the SE corner and have the maximum length.1, 2, 6, 20, 2, 64, 44, 512...
A357532a(n) = Sum_{0..floor(n/3)} (n-2k)!/(n-3k)!.1, 1, 1, 2, 3, 4, 7, 12...
A357533a(n) = Sum_{0..floor(n/4)} (n-3k)!/(n-4k)!.1, 1, 1, 1, 2, 3, 4, 5...
A357546Coefficients a(n) of xn, n >= 0, in A(x) such that: 2 = Sum_{n=-oo..+oo} x2*n * (1 - xn)2*n * A(x)n.1, 2, 4, 6, 12, 18, 52, 92...
A357552a(n) = sigma(n) * binomial(2*n-1,n), for n >= 1.1, 9, 40, 245, 756, 5544, 13728, 96525...
A357570a(n) = Sum_{0..floor(n/5)} (n-4k)!/(n-5k)!.1, 1, 1, 1, 1, 2, 3, 4...
A357592Number of edges of the Minkowski sum of n simplices with vertices e_(i+1), e_(i+2), e_(i+3) for i=0,...,n-1, where e_i is a standard basis vector.3, 11, 34, 96, 260, 683, 1757, 4447...
A357593Number of faces of the Minkowski sum of n simplices with vertices e_(i+1), e_(i+2), e_(i+3) for i=0,...,n-1, where e_i is a standard basis vector.8, 26, 88, 298, 1016, 3466, 11832, 40394...
A357603a(n) is the number of different pairs of shortest paths in an n X n lattice going between opposite corners in opposite directions and not meeting at their middle point.0, 2, 18, 236, 3090, 42252, 589932, 8383608...
A357604Number of prime powers in the sequence of the floor of n/k for k <= n, A010766.0, 1, 1, 2, 2, 2, 3, 4...
A357611A refinement of the Mahonian numbers (canonical ordering).1, 1, 1, 1, 2, 2, 1, 1...
A357618a(n) = sum of lengths of partitions of more than one consecutive positive integer adding up to n.0, 0, 0, 2, 0, 2, 3, 2...
A357715Decimal expansion of sqrt(16 + 32 / sqrt(5)).5, 5, 0, 5, 5, 2, 7, 6...
A357756a(n) is the least k > 0 such that A007953(nk) equals A007953((nk)2), where A007953 is the sum of the digits.1, 1, 5, 3, 25, 2, 3, 27...
A357760a(n) is the number of different pairs of shortest grid paths joining two opposite corners in opposite order in an n X n X n grid with middle point on the paths as a common point.6, 1782, 163968, 145833750, 20373051636, 24849381916800, 4084135317043200, 5797029176271753750...
A357840Numbers k in A018900 with arithmetic derivative k' (A003415) in A018900.6, 9, 20, 40, 65, 68, 96, 144...
A357841Smith numbers (A006753) for which the arithmetic derivative (A003415) is also a Smith number.4, 27, 85, 121, 166, 265, 517, 526...
A357842a(n) is the smallest number k for which k and the arithmetic derivative k' (A003415) have exactly n triangular divisors (A000217).2, 27, 18, 72, 612, 1764, 756, 8100...
A357888a(n) is the minimal squared length of the longest side of a strictly convex grid polygon of smallest area.2, 1, 2, 2, 5, 2, 5, 5...
A357889a(n) = (A022010(n) - 179)/210.26, 422, 1355, 2983, 4074, 5460, 31242, 35906...
A357890a(n) = (A022013(n) - 173)/210.422, 1355, 4074, 5460, 31242, 329316, 353648, 1038255...
A357894Integers k such that the sum of some number of initial decimal digits of sqrt(k) is equal to k.0, 1, 6, 10, 14, 18, 27, 33...
A357949a(n) = Sum_{k=0..floor(n/4)} (n-3*k)!/k!.1, 1, 2, 6, 25, 122, 726, 5064...
A358022Least odd number m such that m*2n is an amicable number, and -1 if no such number exists.12285, 605, 55, 779, 1081, 37, 119957, 73153...
A358023Number of partitions of n into at most 2 distinct squarefree parts.1, 1, 1, 2, 1, 2, 2, 3...
A358024Number of partitions of n into at most 3 distinct squarefree parts.1, 1, 1, 2, 1, 2, 3, 3...
A358025Number of partitions of n into at most 4 distinct squarefree parts.1, 1, 1, 2, 1, 2, 3, 3...
A358029Decimal expansion of the ratio between step sizes of the diatonic and chromatic semitones produced by a circle of 12 perfect fifths in Pythagorean tuning.1, 2, 6, 0, 0, 1, 6, 7...
A358041The number of maximal antichains in the lattice of set partitions of an n-element set.1, 2, 3, 32, 14094
A358043Numbers k such that phi(k) is a multiple of 8.15, 16, 17, 20, 24, 30, 32, 34...
A358044a(n) is the smallest number k such that n consecutive integers starting at k have the same number of triangular divisors (A007862).1, 1, 55, 5402, 2515069
A358139Numbers k > 0 sorted by k/A000120(k) in increasing order. A000120 is the binary weight of k. If k/A000120(k) yields equal values, the smaller k will appear first.1, 3, 2, 7, 5, 6, 11, 15...
A358185Coefficients of xn/n! in the expansion of (1 - x)*log(1 - x).0, -1, 1, 1, 2, 6, 24, 120...
A358199a(n) is the least integer whose sum of the i-th powers of the proper divisors is a prime for 1 <= i <= n, or -1 if no such number exists.4, 4, 981, 8829, 8829, 122029105, 2282761881
A358243Number of n-regular, N_0-weighted pseudographs on 2 vertices with total edge weight 3, up to isomorphism.1, 4, 9, 15, 21, 28, 34, 41...
A358251a(n) is the minimum number of peeling sequences for a set of n points in the plane, no three of which are collinear.1, 2, 6, 18, 60, 180
A358277a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not previously occurring such that a(n) is coprime to the previous Omega(a(n-1)) terms.1, 2, 3, 4, 5, 6, 7, 8...
A358312Consider the graph of symmetric primes where p and q are connected ifp-q
A358320Least odd number m such that m*2n is a perfect, amicable or sociable number, and -1 if no such number exists.12285, 3, 7, 779, 31, 37, 127, 651...
A358343Primes p such that p + 6, p + 12, p + 18, (p+4)/5, (p+4)/5 + 6, (p+4)/5 + 12 and (p+4)/5 + 18 are also prime.213724201, 336987901, 791091901, 1940820901, 2454494551, 2525191051, 2675901751, 3490984201...
A358350Numbers that can be written as (m + sum of digits of m + product of digits of m) for some m.3, 6, 9, 11, 12, 14, 15, 17...
A358351Number of values of m such that m + (sum of digits of m) + (product of digits of m) is n.0, 0, 1, 0, 0, 1, 0, 0...
A358352a(n) is the smallest number k such that A358351(k) = n.1, 3, 26, 38, 380, 1116, 12912, 95131...
A358355Maximum length of an induced path (or chordless path) in the n-halved cube graph.0, 1, 1, 2, 3, 6, 11, 18...
A358356Maximum length of an induced cycle (or chordless cycle) in the n-halved cube graph.0, 0, 3, 4, 5, 8, 12, 20...
A358357Maximum length of an induced path (or chordless path) in the n-folded cube graph.1, 1, 2, 4, 10, 22
A358358Maximum length of an induced cycle (or chordless cycle) in the n-folded cube graph.0, 3, 4, 6, 12, 24
A358368a(n) = Sum_{k=0..n} C(n)2 * binomial(n + k, k), where C(n) is the n-th Catalan number.1, 3, 40, 875, 24696, 814968, 29899584, 1184303835...
A358369Euler transform of 2floor(n/2), (A016116).1, 1, 3, 5, 12, 20, 43, 73...
A358372Number of nodes in the n-th standard ordered rooted tree.1, 2, 3, 3, 4, 4, 4, 4...
A358373Triangle read by rows where row n lists the sorted standard ordered rooted tree-numbers of all unlabeled ordered rooted trees with n vertices.1, 2, 3, 4, 5, 6, 7, 8...
A358374Numbers k such that the k-th standard ordered rooted tree is an identity tree (counted by A032027).1, 2, 3, 5, 6, 7, 10, 13...
A358375Numbers k such that the k-th standard ordered rooted tree is binary.1, 4, 18, 25, 137, 262146, 393217, 2097161...
A358376Numbers k such that the k-th standard ordered rooted tree is lone-child-avoiding (counted by A005043).1, 4, 8, 16, 18, 25, 32, 36...
A358377Numbers k such that the k-th standard ordered rooted tree is a generalized Bethe tree (counted by A003238).1, 2, 3, 4, 5, 8, 9, 11...
A358378Numbers k such that the k-th standard ordered rooted tree is fully canonically ordered (counted by A000081).1, 2, 3, 4, 5, 7, 8, 9...
A358379Height (or depth) of the n-th standard ordered rooted tree.0, 1, 2, 1, 3, 2, 2, 1...
A358382First of three consecutive primes p,q,r such that r*(p+q) + pq and r(p+q) - p*q are prime.2, 3, 5, 7, 29, 43, 277, 283...
A358387a(n) = 3 * h(n - 1) * h(n) for n >= 1, where h(n) = hypergeom([-n, -n], [1], 2), and a(0) = 1.1, 9, 117, 2457, 60669, 1620729, 45385461, 1311647913...
A358390The number of maximal antichains in the Kreweras lattice of non-crossing set partitions of an n-element set.1, 2, 3, 25, 2117, 22581637702
A358391The number of antichains in the Kreweras lattice of non-crossing set partitions of an n-element set.2, 3, 10, 234, 2342196
A358393First of three consecutive primes p,q,r such that pq + pr - qr, pq - pr + qr and -pq + pr + q*r are all prime.261977, 496163, 1943101, 2204273, 2502827, 2632627, 2822381, 2878543...
A358395Odd numbers k such that sigma(k) + sigma(k+2) > 2*sigma(k+1); odd terms in A053228.1125, 1573, 1953, 2205, 2385, 3465, 5185, 5353...
A358396Even numbers k such that sigma(k) + sigma(k+2) < 2*sigma(k+1); even terms in A053229.104, 134, 164, 314, 404, 494, 524, 554...
A358402a(1) = 0; for n > 1, a(n) is the minimum of the number of terms between a(n-1) and its previous appearance, or the number of terms before the first appearance of a(n-1). If a(n-1) has only appeared once then a(n) = 0.0, 0, 1, 0, 1, 2, 0, 1...
A358407Number of regions formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on each of the two adjacent edges of the square.1, 5, 37, 173, 553, 1365, 2909, 5513...
A358408Number of vertices formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on each of the two adjacent edges of the square.4, 8, 32, 144, 468, 1160, 2512, 4836...
A358409Number of edges formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on each of the two adjacent edges of the square.4, 12, 68, 316, 1020, 2524, 5420, 10348...
A358412Least number k coprime to 2 and 3 such that sigma(k)/k >= n.1, 5391411025, 5164037398437051798923642083026622326955987448536772329145127064375
A358413Smallest 3-abundant number (sigma(x) > 3x) which is not divisible by any of the first n primes.180, 1018976683725, 5164037398437051798923642083026622326955987448536772329145127064375
A358414Smallest 4-abundant number (sigma(x) > 4x) which is not divisible by any of the first n primes.27720, 1853070540093840001956842537745897243375
A358415a(n) is the prime or perfect or amicable or sociable number encountered in the aliquot sequence for 2n.2, 3, 7, 3, 31, 41, 127, 41...
A358416a(1) = 0 and a(n+1) > a(n) is the smallest integer such that a(n+1)2-a(n)2 is triangular.0, 1, 2, 5, 14, 41, 46, 137...
A358417Indices of the triangular numbers in A189475.1, 2, 6, 18, 54, 29, 182, 546...
A358418Least number k coprime to 2, 3, and 5 such that sigma(k)/k >= n.1, 20169691981106018776756331
A358419Least number k coprime to 2, 3, 5, and 7 such that sigma(k)/k >= n.1, 49061132957714428902152118459264865645885092682687973
A358420Primes that are the concatenation pq of two primes p and q with the same number of digits, where r = (p+q)/2, r
A358421Primes that are the concatenation of two primes with the same number of digits.23, 37, 53, 73, 1117, 1123, 1129, 1153...
A358422a(n) is the least prime p such that 5n * p + 6 is the square of a prime.3, 23, 67, 1031, 19, 61463, 290659, 977591...
A358423Numbers k such that A030717(k) = 5.16, 18, 68, 76, 80, 89, 90, 93...
A358424Numbers k such that A030717(k) = 6.20, 23, 30, 127, 147, 166, 170, 191...
A358425Numbers k such that A030717(k) = 7.25, 29, 31, 193, 250, 323, 361, 401...
A358426a(n) is the least prime p such that (p2 - 6)/5n is prime.3, 11, 41, 359, 109, 13859, 67391, 276359...
A358427a(n) is the least prime p such that there are exactly n primes q with the same number of digits as p such that the concatenations pq and q
A358428Numbers k such that k2 + 1, k2 + 2 and k2 + 3 are all squarefree.2, 6, 8, 10, 16, 20, 26, 28...
A358433Triangular array read by rows. T(n,k) is the number of n X n matrices over GF(2) with index k, n>=1, 1<=k<=n.2, 13, 3, 365, 105, 42, 43801, 12915...
A358436a(n) = Sum_{j=0..n} C(n)*C(n-j), where C(n) is the n-th Catalan number.1, 2, 8, 45, 322, 2730, 26004, 268554...
A358437a(n) = Sum_{j=0..n} binomial(n, j)*C(n)*C(n-j), where C(n) is the n-th Catalan number.1, 2, 10, 75, 714, 7896, 96492, 1265550...
A358438a(1) = 4, a(2) = 6; then a(n + 1) is the smallest semiрrime number > a(n) such that the sum of any three consecutive terms is a semiprime.4, 6, 15, 25, 34, 35, 46, 62...
A358439a(n) is the total number of holes in all positive n-digit integers, assuming 4 has no hole.4, 85, 1300, 17500, 220000, 2650000, 31000000, 355000000...
A358440a(n) is the largest prime that divides any two successive terms of the sequence b(m) = m2 + n with m >= 1.5, 3, 13, 17, 7, 5, 29, 11...
A358444a(1) = 1, a(2) = 2; for n > 2, a(n) = smallest positive number which has not appeared that has a common factor with a(n-2)2 + a(n-1)2.1, 2, 5, 29, 4, 857, 10, 734549...
A358446a(n) = n! * Sum_{k=0..floor(n/2)} 1/binomial(n-k, k).1, 1, 4, 9, 56, 190, 1704, 7644...
A358447Numbers k such that there exist primes p, q, r, s with k = p + q = r + s = pq - rs.16, 24, 96, 120, 240, 264, 504, 744...
A358448Indices of record values of A036450(n) = d(d(d(n))).1, 2, 12, 60, 5040, 3603600, 908107200, 15437822400...
A358449Euler transform of (0, 1, -2, 4, -8, 16, ...), (cf. A122803).1, 1, -1, 3, -4, 4, -2, 2...
A358450Decimal expansion of 2*EllipticK(i) - EllipticE(i), reciprocal of A088375.7, 1, 1, 9, 5, 8, 6, 5...
A358451Inverse Euler transform of the Riordan numbers, (A005043).1, 0, 1, 1, 2, 5, 11, 28...
A358453Number of transitive ordered rooted trees with n nodes.1, 1, 1, 2, 4, 8, 17, 37...
A358454Number of weakly transitive ordered rooted trees with n nodes.1, 1, 1, 3, 6, 13, 33, 80...
A358455Number of recursively anti-transitive ordered rooted trees with n nodes.1, 1, 2, 4, 10, 26, 72, 206...
A358456Number of recursively bi-anti-transitive ordered rooted trees with n nodes.1, 1, 2, 3, 7, 17, 47, 117...
A358457Numbers k such that the k-th standard ordered rooted tree is transitive (counted by A358453).1, 2, 4, 7, 8, 14, 15, 16...
A358458Numbers k such that the k-th standard ordered rooted tree is weakly transitive (counted by A358454).1, 2, 4, 6, 7, 8, 12, 14...
A358459Numbers k such that the k-th standard ordered rooted tree is balanced (counted by A007059).1, 2, 3, 4, 5, 8, 9, 11...
A358460Number of locally disjoint ordered rooted trees with n nodes.1, 1, 2, 5, 13, 36, 103, 301...
A358462a(1) = 1, a(2) = -1; for n > 2, a(n) is smallest magnitude non-zero integer which has not appeared such that the quadratic equation a(n-2)*x2 + a(n-1)*x + a(n) = 0 has at least one integer root.1, -1, -2, 3, 2, -5, -3, 8...
A358463a(n) is the first average of a twin prime pair that is the sum of two distinct averages of twin prime pairs in exactly n ways.4, 18, 72, 180, 240, 462, 420, 1062...
A358464a(n) is the greatest m such that Sum_{k = 1..m} 1/(1 + n*k) <= 1.2, 6, 16, 42, 110, 288, 761, 2020...
A358466Number of 1's that appeared by n-th step when constructing A030717.1, 2, 2, 3, 3, 4, 4, 5...
A358467Number of 1's that appeared in the n-th step when constructing A030717.1, 1, 0, 1, 0, 1, 0, 1...
A358468Number of 2's that appeared by n-th step when constructing A030717.0, 0, 1, 2, 3, 3, 3, 3...
A358469Number of 2's that appeared in the n-th step when constructing A030717.0, 0, 1, 1, 1, 0, 0, 0...
A358470Number of 3's that appeared by n-th step when constructing A030717.0, 0, 0, 0, 1, 3, 5, 6...
A358472Number of 4's that appeared by n-th step when constructing A030717.0, 0, 0, 0, 0, 0, 1, 2...
A358473Number of 5's that appeared by n-th step when constructing A030717.0, 0, 0, 0, 0, 0, 0, 1...
A358474Number of 6's that appeared by n-th step when constructing A030717.0, 0, 0, 0, 0, 0, 0, 0...
A358475Number of 7's that appeared by n-th step when constructing A030717.0, 0, 0, 0, 0, 0, 0, 0...
A358476Number of 3's that appeared in the n-th step when constructing A030717.0, 0, 0, 0, 1, 2, 2, 1...
A358477Number of 4's that appeared in the n-th step when constructing A030717.0, 0, 0, 0, 0, 0, 1, 1...
A358478Number of 5's that appeared in the n-th step when constructing A030717.0, 0, 0, 0, 0, 0, 0, 1...
A358479Number of 6's that appeared in the n-th step when constructing A030717.0, 0, 0, 0, 0, 0, 0, 0...
A358480Number of 7's that appeared in the n-th step when constructing A030717.0, 0, 0, 0, 0, 0, 0, 0...
A358483Numbers k such that k, k+1 and k+2 are all infinitary abundant numbers (A129656).2666847104, 2695309694, 8207456894, 8967010688, 12147283070, 12491149670, 13911605630, 14126720894...
A358484Numbers k such that k, k+1 and k+2 are all bi-unitary abundant numbers (A292982).268005374, 600350750, 2666847104, 2683146464, 2695309694, 2849458688, 3904592768, 4112553248...
A358485a(n) is the maximal determinant of an n X n matrix using the integers 0 to n2 - 1.1, 0, 6, 332, 36000, 6313388, 1765146660
A358486a(n) is the minimal permanent of an n X n matrix using the integers 0 to n2 - 1.1, 0, 2, 128, 18948, 40179728, 2863042492
A358487a(n) is the maximal permanent of an n X n matrix using the integers 0 to n2 - 1.1, 0, 6, 553, 107140, 40179728, 27312009708
A358491a(n) = n!*Sum_{m=0..floor((n-1)/2)} 1/(n-m)/binomial(n-m-1,m).1, 1, 5, 10, 74, 216, 2316, 8688...
A358493a(n) = Sum_{k=0..floor(n/3)} (n-2*k)!/k!.1, 1, 2, 7, 26, 126, 745, 5163...
A358494a(n) = Sum_{k=0..floor(n/5)} (n-4*k)!/k!.1, 1, 2, 6, 24, 121, 722, 5046...
A358495a(n) = Sum_{k=0..n} binomial(binomial(n, k), n).1, 2, 1, 2, 17, 506, 48772, 13681602...
A358496a(n) = Sum_{k=0..n} binomial(binomial(n, k), k).1, 2, 3, 7, 24, 176, 2623, 79479...
A358498a(n) = Sum_{k=0..floor(n/3)} (n-3*k)!.1, 1, 2, 7, 25, 122, 727, 5065...
A358499a(n) = Sum_{k=0..floor(n/4)} (n-4*k)!.1, 1, 2, 6, 25, 121, 722, 5046...
A358500a(n) = Sum_{k=0..floor(n/5)} (n-5*k)!.1, 1, 2, 6, 24, 121, 721, 5042...

r/OEIS • • Aug 24 '16

[x-post r/math] Is there an OEIS sequence that solves a similar partition problem to this one being asked?

Thumbnail
reddit.com
2 Upvotes

r/OEIS • • Nov 06 '22

New OEIS sequences - week of 11/06

3 Upvotes
OEIS numberDescriptionSequence
A355553Number of ways to select 3 or more collinear points from an n X n grid.0, 0, 8, 54, 228, 708, 1980, 4890...
A355930Sum of the prime indices of n minus the sum of the prime indices of the smallest number with same prime signature as n, when the sum is taken with multiplicity, as in A056239.0, 0, 1, 0, 2, 0, 3, 0...
A356163a(n) = 1 if sum of prime factors of n (taken with multiplicity) is even, otherwise 0.1, 1, 0, 1, 0, 0, 0, 1...
A356170a(n) = 1 if A001222(n) == 2*A007814(n), and otherwise 0, where A001222 is bigomega (number of prime factors with multiplicity) and A007814 is the 2-adic valuation of n.1, 0, 0, 0, 0, 1, 0, 0...
A356299a(n) = gcd(A276086(n), A342001(n)), where A276086 is the primorial base exp-function, and A342001 is the arithmetic derivative without its inherited divisor.2, 1, 1, 1, 1, 5, 1, 3...
A356302The least k >= 0 such that n and A276086(n+k) are relatively prime, where A276086 is the primorial base exp-function.0, 0, 0, 3, 0, 0, 0, 0...
A356303The least k >= 0 such that n and A276086(n-k) are relatively prime, where A276086 is the primorial base exp-function.0, 0, 0, 2, 0, 0, 0, 0...
A356304The least k >= 0 such that A003415(n) and A276086(n+k) are relatively prime, where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.0, 0, 0, 0, 24, 0, 4, 3...
A356305The least k >= 0 such that A003415(n) and A276086(n-k) are relatively prime, where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.0, 1, 0, 0, 0, 0, 1, 0...
A356309The least j >= n such that n and A276086(j) are relatively prime, where A276086 is the primorial base exp-function.0, 1, 2, 6, 4, 5, 6, 7...
A356310a(n) = 1 if A003415(n) and A276086(n) are relatively prime, otherwise 0. Here A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.1, 0, 1, 1, 1, 1, 0, 1...
A356311Numbers k for which A003415(k) and A276086(k) are relatively prime, where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.0, 2, 3, 4, 5, 7, 10, 11...
A356312Numbers k such that A003415(k) and A276086(k) are not relatively prime, where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.1, 6, 8, 9, 14, 15, 20, 21...
A356313a(n) = 1 if {the least k >= n such that n and A276086(k) are coprime} is one of the primorial numbers (A002110), otherwise 0.0, 1, 1, 1, 0, 0, 1, 0...
A356314Positions of primorial numbers (A002110) in A356309.1, 2, 3, 6, 10, 15, 20, 25...
A356315a(n) = 1 if n divides the least j >= n such that n and A276086(j) are coprime, otherwise 0. Here A276086 is the primorial base exp-function.1, 1, 1, 1, 1, 1, 1, 1...
A356316Numbers k such that k divides the least j >= k for which k and A276086(j) are coprime, where A276086 is the primorial base exp-function.1, 2, 3, 4, 5, 6, 7, 8...
A356317Numbers k such that k does not divide the least j >= k for which k and A276086(j) are coprime, where A276086 is the primorial base exp-function.9, 20, 21, 25, 27, 33, 39, 40...
A356318Numbers k such that the least j >= k for which k and A276086(j) are coprime is a nontrivial multiple of k, where A276086 is the primorial base exp-function.3, 10, 15, 35, 42, 70, 77, 105...
A356319Numbers k such that {the least j >= k for which k and A276086(k+j) are coprime} is larger than 0, but less than k, where A276086 is the primorial base exp-function.9, 20, 21, 25, 27, 33, 39, 40...
A356544Number of strict closure operators on a set of n elements such that all pairs of nonempty disjoint closed sets can be separated by clopen sets.0, 1, 4, 35, 857
A356693Decimal expansion of the constant B(2) = Sum_{n>=1} Sum_{m>=n+1} 1/(z(n)*z(m))2 where z(n) is the imaginary part of the n-th nontrivial zero of the Riemann zeta function.0, 0, 0, 2, 4, 8, 3, 3...
A356833Primes p such that the minimum number of divisors among the numbers between p and NextPrime(p) is a square.5, 13, 19, 31, 37, 43, 53, 61...
A356835Coordination sequence of the {4,3,5} hyperbolic honeycomb.1, 6, 30, 126, 498, 1982, 7854, 31014...
A356836Coordination sequence of the {5,3,4} hyperbolic honeycomb.1, 12, 102, 812, 6402, 50412, 396902, 3124812...
A356837Coordination sequence of the {3,5,3} hyperbolic honeycomb.1, 20, 260, 3212, 39470, 484760, 5953532, 73117640...
A356891a(n) = a(n-1) * a(n-2) + 1 if n is even, otherwise a(n) = a(n-3) + 1, with a(0) = a(1) = 1.1, 1, 2, 2, 5, 3, 16, 6...
A357131Numbers m such that A010888(m) = A031347(m) = A031286(m) = A031346(m); only the least of the anagrams are considered.0, 137, 11126, 111134, 111278, 1111223, 11111447, 111112247...
A357143a(n) is sum of the base-5 digits of n each raised to the number of digits of n in base 5.1, 2, 3, 4, 1, 2, 5, 10...
A357170Primes p such that the minimum number of divisors among the numbers between p and NextPrime(p) is a prime power.3, 5, 7, 13, 19, 23, 29, 31...
A357175Primes p such that the minimum of the number of divisors among the numbers between p and NextPrime(p) is a cube.29, 41, 101, 137, 229, 281, 349, 439...
A357190a(n) is the least prime p such that A234575(p, A007953(p)) is the n-th power of a prime.17, 13, 131, 107, 383, 613, 43607, 1021...
A357211a(n) is the real cube root of the value of the j-function for the n-th Heegner number A003173(n).12, 20, 0, -15, -32, -96, -960, -5280...
A357269Maximum number of stable matchings in the stable marriage problem of order n.1, 2, 3, 10, 16
A357271Lower bounds for the maximum number of stable matchings in the stable marriage problem based on composing smaller instances.1, 2, 3, 10, 16, 48, 71, 268...
A357294Number of integral quantales on n elements, up to isomorphism.1, 1, 2, 9, 49, 364, 3335, 37026...
A357295Number of balanced quantales on n elements, up to isomorphism.1, 1, 9, 106, 1597, 29720, 663897, 17747907...
A357376The lowest number on Ulam Spiral for which all numbers in the square which is centered at a(n) and spans n-1 spaces in each cardinal direction are nonprime.1, 26, 1016, 5136, 39639, 203100, 2729736, 32264250...
A357408a(n) is the least sum n + y such that 1/n + 1/y = 1/z with gcd(n,y,z) = 1, for some integers y and z.4, 9, 16, 25, 9, 49, 64, 81...
A357442Consider a clock face with 2*n "hours" maked around the dial; a(n) = number of ways to match the even hours to the odd hours, modulo rotations and reflections.1, 1, 3, 5, 17, 53
A357470Decimal expansion of the real root of x3 - x2 - 2*x - 1.2, 1, 4, 7, 8, 9, 9, 0...
A357471Decimal expansion of the real root of x3 - x2 + 2*x - 1.5, 6, 9, 8, 4, 0, 2, 9...
A357472Decimal expansion of the real root of x3 + x2 + 2*x - 1.3, 9, 2, 6, 4, 6, 7, 8...
A357489Numbers k such that the k-th composition in standard order is a triple (w,x,y) such that 2w = 3x + 4y.133, 1034, 4113, 8212, 32802, 65576, 131137, 262212...
A357528Decimal expansion of Sum_{j>=1} 1/A031926(j)2.0, 0, 0, 1, 8, 3, 9, 3...
A357602a(n) is the number of n-gons in A000940 that are asymmetric.0, 0, 0, 1, 15, 121, 1026, 8696...
A357734Array T(n,k), read by descending antidiagonals, whose rows are numbers congruent to p or q mod r, with 0 <= p < q < r, sorted by r, then p, then q.0, 1, 0, 2, 1, 0, 3, 3...
A357849Number of integer partitions (w,x,y) summing to n such that 2w = 3x + 4y.0, 0, 0, 0, 0, 0, 0, 0...
A357891a(1) = 1; a(n+1) is the smallest integer > 0 that cannot be obtained from the integers {a(1), ..., a(n)} using each number exactly once and the operators +, -, *, /.1, 2, 4, 11, 34, 152, 1079, 6610...
A357938Inverse Moebius transform of n * 2omega(n).1, 5, 7, 13, 11, 35, 15, 29...
A357956a(n) = 5A005259(n) - 2A005258(n).3, 19, 327, 6931, 162503, 4072519, 107094207, 2919528211...
A357957a(n) = A005259(n)5 - A005258(n)2.0, 3116, 2073071232, 6299980938881516, 39141322964380888600000, 368495989505416178203682748116, 4552312485541626792249211584618373944, 68109360474242016374599574592870648425552876...
A357958a(n) = 5A005259(n) + 14A005258(n-1).39, 407, 7491, 167063, 4112539, 107461667, 2923006251, 81853622423...
A357959a(n) = 5A005259(n-1) + 2A005258(n).11, 63, 659, 9727, 187511, 4304943, 109312739, 2941124607...
A357960a(n) = A005259(n-1)5 * A005258(n)6.729, 147018378125, 20917910914764786689697, 24148107115850058575342740485778125, 79477722547796770983047586179643766765851375729, 492664048531500749211923278756418311980637289373757041378125, 4671227340507161302417161873394448514470099313382652883508175438056640625
A358027Expansion of g.f.: (1 + x - 2x2 + 2x4)/((1-x)(1-3x2)).1, 2, 3, 6, 11, 20, 35, 62...
A358035a(n) = (8n3 + 12n2 + 4*n - 9)/3.5, 37, 109, 237, 437, 725, 1117, 1629...
A358036Number of n-step self-avoiding walks on a 2D square lattice where the first visited lattice point is directly visible from the last visited lattice point, and were both the visited lattice points and the path between these points are considered when determining the visibility of points.0, 8, 24, 48, 144, 336, 992, 2344...
A358042Partial sums of A071619.0, 1, 4, 10, 21, 38, 62, 95...
A358046Number of n-step self-avoiding walks on a 2D square lattice where the first visited lattice point is directly visible from the last visited lattice point, and were only visited lattice points are considered when determining the visibility of points.4, 8, 32, 64, 240, 480, 1904, 3832...
A358050Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} binomial(kj,j) * binomial(k(n-j),n-j).1, 1, 0, 1, 2, 0, 1, 4...
A358052Triangular array read by rows. For T(n,k) where 1 <= k <= n, start with x = k and repeat the map x -> floor(n/x) + (n mod x) until an x occurs that has already appeared. The number of applications of the map is T(n,k).1, 2, 2, 2, 1, 2, 2, 1...
A358066Inventory sequence: record where the 1's, 2's, etc. are located starting with a(1) = 1, a(2) = 1 (see example).1, 1, 1, 2, 1, 2, 3, 4...
A358067a(n) is the smallest m such that A144261(m) = n.1, 15, 14, 33, 22, 17, 73, 49...
A358072a(n) is the number of "merger histories" of n elements (see A256006) where at most 3 elements can merge at the same time.1, 1, 4, 28, 320, 5360, 123760, 3765440...
A358082a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not previously occurring that shares a factor with Sum_{k=1..n-1} sigma(a(k)).1, 2, 4, 11, 23, 47, 5, 101...
A358083Sum of square end-to-end displacements over all n-step self-avoiding walks of A358046.4, 16, 128, 448, 2256, 5376, 29424, 69888...
A358084Sum of square end-to-end displacements over all n-step self-avoiding walks of A358036.0, 16, 88, 288, 1104, 3264, 12032, 34144...
A358085Inventory of positions ordered by binary lengths of terms, as an irregular table; the first row contains 1, subsequent rows contains the 1-based positions of terms with binary length 1, followed by positions of terms with binary length 2, 3, etc. in prior rows flattened.1, 1, 1, 2, 1, 2, 3, 4...
A358086Inventory of positions ordered by odd parts of terms, as an irregular table; the first row contains 1, subsequent rows contains the 1-based positions of terms with odd part 1, followed by positions of terms with odd part 3, 5, etc. in prior rows flattened.1, 1, 1, 2, 1, 2, 3, 4...
A358089First differences of A126706.6, 2, 4, 4, 8, 4, 4, 1...
A358090Partial inventory of positions as an irregular table; rows 1 and 2 contain 1, for n > 2, row n contains the 1-based positions of 1's, followed by the positions of 2's, 3's, etc. in rows n-2 and n-1 flattened.1, 1, 1, 2, 1, 2, 3, 1...
A358094a(n) is the number of ways n can be reached in the following method: we start with 1, then add or multiply alternately, and each operand must be 2 or 3.1, 1, 2, 2, 2, 2, 0, 3...
A358097a(n) is the smallest integer m > n such that m and n have no common digit, or -1 when such integer m does not exist.1, 2, 3, 4, 5, 6, 7, 8...
A358099a(n) is the number of divisors of n whose digits are in strictly decreasing order (A009995).1, 2, 2, 3, 2, 4, 2, 4...
A358100a(n) is the smallest integer that has exactly n divisors whose decimal digits are in strictly decreasing order.1, 2, 4, 6, 12, 20, 30, 40...
A358101Positions of records in A358099, i.e., integers whose number of divisors whose decimal digits are in strictly decreasing order sets a new record.1, 2, 4, 6, 12, 20, 30, 40...
A358102Numbers of the form prime(w)*prime(x)*prime(y) with w >= x >= y such that 2w = 3x + 4y.66, 153, 266, 609, 806, 1295, 1599, 1634...
A358103Quotient of the n-th divisible pair, where pairs are ordered by Heinz number. Quotient of prime indices of A318990(n).1, 2, 1, 3, 4, 2, 5, 1...
A358104Unreduced numerator of the n-th divisible pair, where pairs are ordered by Heinz number. Greater prime index of A318990(n).1, 2, 2, 3, 4, 4, 5, 3...
A358105Unreduced denominator of the n-th divisible pair, where pairs are ordered by Heinz number. Lesser prime index of A318990(n).1, 1, 2, 1, 1, 2, 1, 3...
A358106Quotient of the n-th divisible pair, where pairs are ordered first by sum and then by denominator.1, 2, 3, 1, 4, 5, 2, 1...
A358120Partial inventory of positions as an irregular table; rows 1 and 2 contain 1, for n > 2, row n contains the 1-based positions of 1's, followed by the positions of 2's, 3's, etc. in rows n-1 and n-2 flattened.1, 1, 1, 2, 1, 3, 2, 1...
A358121Distinct values of A358085, in order of appearance.1, 2, 3, 4, 5, 6, 7, 8...
A358122Distinct values of A358086, in order of appearance.1, 2, 3, 4, 5, 6, 8, 7...
A358123Distinct values of A358090, in order of appearance.1, 2, 3, 4, 5, 6, 7, 8...
A358124Distinct values of A358120, in order of appearance.1, 2, 3, 4, 5, 6, 8, 7...
A358127a(n) is the cardinality of the set of pairwise gcd's of {prime(1)+1, ..., prime(n)+1}.1, 3, 4, 5, 5, 5, 5, 7...
A358129Lexicographically earliest sequence of distinct nonnegative integers on a square spiral such that no number shares a digit with any of its four orthogonally adjacent neighbors.0, 1, 2, 3, 4, 5, 6, 7...
A358133Triangle read by rows whose n-th row lists the first differences of the n-th composition in standard order (row n of A066099).0, -1, 1, 0, 0, -2, 0, -1...
A358134Triangle read by rows whose n-th row lists the partial sums of the n-th composition in standard order (row n of A066099).1, 2, 1, 2, 3, 2, 3, 1...
A358135Difference of first and last parts of the n-th composition in standard order.0, 0, 0, 0, -1, 1, 0, 0...
A358136Irregular triangle read by rows whose n-th row lists the partial sums of the prime indices of n (row n of A112798).1, 2, 1, 2, 3, 1, 3, 4...
A358137Heinz number of the partial sums of the prime indices of n.1, 2, 3, 6, 5, 10, 7, 30...
A358138Difference between maximum and minimum part in the n-th composition in standard order.0, 0, 0, 0, 1, 1, 0, 0...
A358140Inverse permutation to A358121.1, 2, 3, 4, 5, 6, 7, 8...
A358141Inverse permutation to A358122.1, 2, 3, 4, 5, 6, 8, 7...
A358142Inverse permutation to A358123.1, 2, 3, 4, 5, 6, 7, 8...
A358143Inverse permutation to A358124.1, 2, 3, 4, 5, 6, 8, 7...
A358144Number of strict closure operators on a set of n elements such that all pairs of distinct points can be separated by clopen sets.0, 0, 1, 16, 1067
A358145a(n) = Sum_{k=0..n} binomial(nk,k) * binomial(n(n-k),n-k).1, 2, 16, 258, 6184, 195660, 7674144, 358788696...
A358146Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..n} binomial(k*j,j).1, 1, 1, 1, 2, 1, 1, 3...
A358147Primes p such that the polynomial x7 - 7*x + 3 (mod p) is the product of seven linear factors.1879, 5381, 5783, 8819, 8893, 12007, 12917, 13967...
A358150Squares visited by a knight moving on a square-spiral numbered board where the knight moves to the smallest numbered unvisited square and where the square number is more than the number of currently visited squares.1, 10, 3, 6, 9, 12, 15, 18...
A358152Number of strict closure operators on a set of n elements such that every point and every set disjoint from that point can be separated by clopen sets.1, 1, 2, 8, 121
A358153Lexicographically earliest infinite sequence of distinct positive integers on a square spiral such that each number shares a factor with its four orthogonally nearest neighbors but shares no factor with its four diagonal next-nearest neighbors.6, 10, 35, 21, 77, 22, 143, 39...
A358157a(n) is the permanent of the n X n matrix M(n) that is defined by M[i,j] = floor(i*j/3).1, 0, 0, 1, 32, 1422, 146720, 18258864...
A358158a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i,j] = floor(i*j/3).1, 0, 4, 238, 31992, 9390096
A358159a(n) is the permanent of the n X n matrix M(n) that is defined by M[i,j] = ij - floor(ij/3).1, 1, 7, 102, 4396, 374216, 49857920, 11344877568...
A358160a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i,j] = ij - floor(ij/3).1, 2, 40, 3884, 1016376, 534983256
A358161a(n) is the permanent of the n X n matrix M(n) that is defined by M[i,j] = ceiling(i*j/3).1, 1, 3, 19, 434, 18142, 1138592, 131646240...
A358162a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i,j] = ceiling(i*j/3).1, 1, 11, 530, 71196, 18680148
A358163a(n) is the permanent of the n X n matrix M(n) that is defined by M[i,j] = ij - ceiling(ij/3).1, 0, 1, 30, 1272, 113224, 18615680, 4299553536...
A358164a(n) is the hafnian of the 2n X 2n symmetric matrix defined by M[i,j] = ij - ceiling(ij/3).1, 1, 26, 2704, 698568, 384890688
A358165Irregular triangular array read by rows. T(n,k) is the number of direct sum decompositions V_1 + V_2 + ... + V_m = GF(2)n with the dimensions of the V_i corresponding to the kth partition of n in canonical ordering, n>=0, 1<=k<=A000041(n).1, 1, 1, 3, 1, 28, 28, 1...
A358168First n-digit number to occur in Van Eck's Sequence (A181391).0, 14, 131, 1024, 10381, 100881, 1014748, 10001558...
A358169Row n lists the first differences plus one of the prime indices of n with 1 prepended.1, 2, 1, 1, 3, 1, 2, 4...
A358173First differences of A286708.36, 28, 8, 36, 52, 4, 16, 9...
A358174Smaller of a pair of numbers (m, m+1) such that both are products P of composite prime powers with omega(P) > 1.675, 9800, 235224, 465124, 1825200, 11309768, 384199200, 592192224...
A358175a(1) = 1, a(2) = 2; a(3) = 3; for n > 3, a(n) is the smallest positive number not previously occurring that shares a factor with Sum_{k=1..n-1} A001065(a(k)), where A001065(m) is the sum of the proper divisors of m.1, 2, 3, 4, 5, 6, 8, 19...
A358176a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not previously occurring that shares a factor with sigma(a(n-1)).1, 2, 3, 4, 7, 6, 8, 5...
A358177Number of Eulerian orientations of a (labeled) 2n-dimensional hypercube graph, Q_2n. Q_2n is also the n-dimensional torus grid graph (C_4)n.1, 2, 2970, 351135773356461511142023680
A358180Indices for A358168.1, 30, 162, 1150, 11603, 104511, 1041245, 10226995...
A358191Decimal expansion of Sum_{n >= 2} (n-1)/(nn).3, 3, 7, 1, 8, 7, 7, 1...
A358192Numerator of the quotient of the prime indices of the n-th semiprime.1, 1, 1, 1, 1, 2, 1, 1...
A358193Denominator of the quotient of the prime indices of the n-th semiprime.1, 2, 1, 3, 4, 3, 2, 5...
A358196Numbers k such that 5k and 8k have the same leading digit.0, 5, 9, 15, 19, 29, 34, 39...
A358201a(1) = 1, a(2) = 2; for n > 2, a(n) is the smallest positive number not previously occurring that shares a factor with sigma(max_{k=1..n-1}a(k)).1, 2, 3, 4, 7, 6, 8, 5...
A358203Decimal expansion of Sum_{n >= 1} 1/(2*n)n.5, 6, 7, 3, 8, 4, 1, 1...
A358204Decimal expansion of Sum_{n >= 1} (-1)n+1/(2*n)n.4, 4, 1, 8, 9, 5, 1, 6...
A358205a(n) is the least number k such that 1 + 2k + 3k2 has exactly n prime divisors, counted with multiplicity.0, 2, 1, 13, 19, 7, 61, 331...
A358213Positions of records in A356302.0, 3, 10, 35, 77, 286, 2431, 4199...
A358214Record values in A356302.0, 3, 20, 175, 2233, 29744, 508079, 9695491...
A358217Number of prime factors (with multiplicity) in A319627(n).0, 0, 1, 0, 1, 0, 1, 0...
A358218Number of prime factors (with multiplicity) in A328478(n).0, 0, 1, 0, 1, 0, 1, 0...
A358219Indices k where A358217(k) != A358218(k).15, 35, 45, 70, 75, 77, 105, 135...
A358239Numbers k such that the aliquot sequence of 2k ends with the prime 3.2, 4, 55, 164, 305, 317
A358252a(n) is the least number with exactly n non-unitary square divisors.1, 8, 32, 128, 288, 864, 1152, 2592...
A358253Numbers with a record number of non-unitary square divisors.1, 8, 32, 128, 288, 864, 1152, 2592...
A358254Lexicographically earliest sequence of distinct nonnegative integers on a square spiral such that the sum of the eight numbers around any chosen number ends in the chosen number.0, 1, 2, 3, 4, 5, 6, 7...
A358255Primitive Niven numbers ending with zero.110, 140, 150, 190, 220, 230, 280, 320...
A358256a(n) is the smallest primitive Niven number ending with n zeros.1, 110, 1300, 17000, 790000, 59900000, 19999999000000, 2999999999999990000000...
A358258First n-bit number to appear in Van Eck's sequence (A181391).0, 2, 6, 9, 17, 42, 92, 131...
A358259Positions of the first n-bit number to appear in Van Eck's sequence (A181391).1, 5, 10, 24, 41, 52, 152, 162...
A358260a(n) is the number of infinitary square divisors of n.1, 1, 1, 2, 1, 1, 1, 2...
A358261a(n) is the number of noninfinitary square divisors of n.0, 0, 0, 0, 0, 0, 0, 0...
A358262a(n) is the least number with exactly n noninfinitary square divisors.1, 16, 144, 256, 3600, 1296, 2304, 65536...
A358263Numbers with a record number of noninfinitary square divisors.1, 16, 144, 256, 1296, 2304, 20736, 57600...
A358264Expansion of e.g.f. 1/(1 - x * exp(x2/2)).1, 1, 2, 9, 48, 315, 2520, 23415...
A358265Expansion of e.g.f. 1/(1 - x * exp(x3/6)).1, 1, 2, 6, 28, 160, 1080, 8470...
A358266Numbers k such that the aliquot sequence of 2k ends with the prime 7.3, 10, 12, 141, 278, 387, 421

r/OEIS • • Jan 16 '23

New OEIS sequences - week of 01/15

3 Upvotes
OEIS numberDescriptionSequence
A358311Lucas numbers that are not the sum of two squares.3, 7, 11, 47, 76, 123, 199, 322...
A358461Number of near-rings with identity of order n, up to isomorphism.1, 1, 6, 1, 1, 1, 53, 11...
A358534Start with a(1)=1, a(2)=2. Thereafter, if gcd(a(n-2),a(n-1)) = 1 then a(n) is the smallest unused k such that gcd(a(n-2),k) > 1 and gcd(a(n-1),k) = 1, otherwise a(n) is the smallest unused k such that gcd(a(n-2),k) = 1 and gcd(a(n-1),k) > 1. If the latter is impossible, then a(n) = smallest missing number u. (See comments.)1, 2, 4, 3, 9, 5, 10, 6...
A358562The number of antichains in the Tamari lattice of order n.2, 3, 8, 83, 28984, 138832442543
A358629a(n) is the number of signed permutations W of V = (1, 2, ..., n) such that the dot product V*W = 0.0, 2, 0, 16, 48, 558, 4444, 62246...
A358690Number of n-digit primes whose digits are all odd.3, 12, 42, 125, 608, 2427, 10081, 43568...
A358693Numbers k such that k / (sum of digits of k) is the square of a prime.12, 24, 36, 48, 81, 150, 225, 375...
A358709a(n) is the number of free, tree-like polyiamonds, of size 3*n+1, with 120-degree rotational symmetry formed of a central triangle and identical, non-intersecting snakes leading from each of its sides.1, 1, 1, 2, 3, 6, 11, 20...
A358921a(1) = 1; a(n) is the smallest positive number not among the terms a(n-c .. n-1) where c = the number of times a(n-1) has occurred.1, 2, 1, 3, 1, 2, 3, 1...
A358943Decimal expansion of the real root of 3*x3 - 2.8, 7, 3, 5, 8, 0, 4, 6...
A358944Decimal expansion of the real root of 4*x3 - 1.6, 2, 9, 9, 6, 0, 5, 2...
A358946All positive integers that are properly represented by each primitive binary quadratic forms of discriminant 28 that is properly equivalent to the principal form [1, 4, -3].1, 2, 9, 18, 21, 29, 37, 42...
A358947a(n) = 2m(n), where m(n) is the number of distinct primes, neither 2 nor 7, dividing A358946(n).1, 1, 2, 2, 2, 2, 2, 2...
A359007a(n) = b(n-b(n)) where b is Van Eck's sequence A181391.0, 0, 0, 0, 1, 0, 2, 0...
A359049Autobiographical numbers k whose decimal digits are a concatenation count(0), count(1), ..., count(m) for some m, where count(j) is the number of (possibly overlapping) occurrences of j within the digits of k itself.1210, 2020, 21200, 3211000, 42101000, 521001000, 6210001000, 53110100002...
A359066a(n) = Sum_{k=0..floor((n-1)/2)} binomial(n,k)*binomial(n-1-k,floor((n-1)/2) - k).1, 1, 5, 7, 31, 49, 209, 351...
A359067a(2n) = Sum_{k=0..n-1} binomial(2n,k) binomial(2n-1-k, n-1-k). a(2n+1) = (Sum_{k=0..n} binomial(2n+1,k) binomial(2n-k, n-k)) - binomial(2*n-1, n).0, 1, 4, 7, 28, 49, 199, 351...
A359073Sum of square end-to-end displacements over all n-step self-avoiding walks of A359709.0, 4, 16, 44, 160, 556, 1744, 12252...
A359110Number of Boolean monoids of order 2n up to isomorphism.1, 5, 83, 242547
A359114a(1) = 1; for n > 1, a(n) is the smallest positive number which has not appeared that shares a factor with the sum of the first n bits of the binary Champernowne string starting from 1.1, 2, 4, 3, 6, 5, 10, 15...
A359115a(n) is the smallest odd prime not already in the sequence such that when the terms a(1)..a(n) are concatenated, the result is the reverse of a prime.3, 5, 11, 7, 29, 37, 89, 211...
A359127Oblong numbers which are products of six distinct primes.43890, 53130, 81510, 108570, 152490, 184470, 188790, 260610...
A359132Least m such that the sum of the aliquot parts of m (A001065) equals n, or -1 if no such number exists.1, 2, -1, 4, 9, -1, 6, 8...
A359133Sum of square end-to-end displacements over all n-step self-avoiding walks of A359741.0, 6, 24, 78, 384, 8190, 8472, 178110...
A359134a(n) = Sum_{dn} (2*d)n/d - 1.
A359181Number of commutative BCK-algebras of order n up to isomorphism.1, 2, 5, 11, 28, 72, 192, 515...
A359182Totient of numbers of least prime signature: a(n) = A000010(A025487(n)).1, 1, 2, 2, 4, 4, 8, 8...
A359196a(n) is the number of subsets of the divisors of n which sum to n+1.0, 1, 1, 1, 1, 1, 1, 1...
A359201Number of edges of regular m-polytopes for m >= 3.6, 10, 12, 15, 21, 24, 28, 30...
A359202Number of (bidimensional) faces of regular m-polytopes for m >= 3.4, 6, 8, 10, 12, 20, 24, 32...
A359213Numbers k such that rad(k) - 1 is prime.3, 6, 9, 12, 14, 18, 24, 27...
A359247The bottom entry in the absolute difference triangle of the elements in the Collatz trajectory of n.1, 1, 1, 1, 0, 1, 0, 1...
A359303Bitwise encoding of the state of a 1D cellular automaton after n steps from ..111000.. where adjacent cells swap 01 <-> 10 when within triples 110 or 011.1, 3, 5, 11, 13, 39, 43, 45...
A359304Oblong numbers which are products of five distinct primes.4290, 4830, 6006, 11130, 12210, 13110, 16770, 23870...
A359364Triangle read by rows. The Motzkin triangle, the coefficients of the Motzkin polynomials. M(n, k) = binomial(n, k) * CatalanNumber(k/2) if k is even, otherwise 0.1, 1, 0, 1, 0, 1, 1, 0...
A359384a(1) = 0. If a(n-1) is a first occurrence, a(n) = A000120(a(n-1)). Otherwise, if a(n-1) is a repeat of a prior terms, a(n) = number of indices j < n such that a(j) = a(n-1).0, 0, 2, 1, 1, 2, 2, 3...
A359390Sequence lists the numbers k such that bottom entry is an integer in the ratio d(i+1)/d(i) triangle of the elements in the divisors of n, where d(1) < d(2) < ... < d(q) denote the divisors of k.1, 2, 3, 4, 5, 7, 8, 9...
A359395Least odd prime p in position n in the prime factorization of M(p) = 2p - 1 - 1.3, 5, 17, 13, 71, 37, 157, 61...
A359406Integers k such that the concatenation of k consecutive primes starting at 31 is prime.1, 2, 3, 23, 43, 141
A359408Integers d such that the largest possible arithmetic progression (AP) of primes with common difference d has only two elements.1, 3, 5, 9, 11, 15, 16, 17...
A359415Numbers k such that phi(k) is a 5-smooth number where phi is the Euler totient function.1, 2, 3, 4, 5, 6, 7, 8...
A359421a(n) = number of abelian groups of order p2 - 1, where p = prime(n).1, 3, 3, 5, 3, 3, 14, 6...
A359442a(n) = Sum_{dn} dn + 1 - d - n/d.
A359456Characteristic function of Fibonorial numbers.1, 1, 0, 0, 0, 1, 0, 0...
A359476The sequence {-a(n)}_{n>=1} gives all negative integers that are properly represented by each primitive binary quadratic forms of discriminant 28 that is properly equivalent to the reduced principal form [1, 4, -3].3, 6, 7, 14, 19, 27, 31, 38...
A359477a(n) = 2m(n), where m(n) is the number of distinct primes, neither 2 nor 7, dividing A359476(n).2, 2, 1, 1, 2, 2, 2, 2...
A359497Greatest positive integer whose weakly increasing prime indices have weighted sum (A304818) equal to n.1, 2, 3, 5, 7, 11, 13, 17...
A359498a(n) = ((2*n+1)8 - 1)/32.0, 205, 12207, 180150, 1345210, 6698715, 25491585, 80090332...
A359499a(n) = ((2*n+1)16 - 1)/64.0, 672605, 2384185791, 519264540150, 28953440450810, 717964529118315, 10397134518487185, 102631380558013916...
A359500a(n) = (72n - 1)/2n+3.3, 75, 90075, 259632270075, 4314170602515315024630075, 2382344702413741601833152075318304337413311121350075, 1452944967966417671787414728262962471027692106596483349510252251060925112718067382475349181570930962790075
A359506a(n) is the least integer m such that there exists a strictly increasing integer sequence n = b_1 < b_2 < ... < b_t = m with the property that b_1 XOR b_2 XOR ... XOR b_t = 0.0, 3, 5, 6, 7, 10, 9, 12...
A359507a(n) is the least integer k such that there exists a strictly increasing integer sequence n = b_1 < b_2 < ... < b_t = n + k with the property that b_1 XOR b_2 XOR ... XOR b_t = 0.0, 2, 3, 3, 3, 5, 3, 5...
A359508a(n) = log_2(A359507(n) - 1).0, 1, 1, 1, 2, 1, 2, 1...
A359509a(n) is the number of subsets {b_1, b_2, ..., b_t} of {n, n+1, ..., A359506(n)} containing n with the property that b_1 XOR b_2 XOR ... XOR b_t = 0.1, 1, 1, 1, 1, 2, 1, 2...
A359537Number of partitions of n into at most 2 distinct positive Fibonacci numbers (with a single type of 1).1, 1, 1, 2, 1, 2, 1, 1...
A359538Number of partitions of n into at most 3 distinct positive Fibonacci numbers (with a single type of 1).1, 1, 1, 2, 1, 2, 2, 1...
A359539Number of partitions of n into at most 4 distinct positive Fibonacci numbers (with a single type of 1).1, 1, 1, 2, 1, 2, 2, 1...
A359553Numerator of the coefficient of x2n+1 in the Taylor series expansion of sin(sin(x)).1, -1, 1, -8, 13, -47, 15481, -15788...
A359554Denominator of the coefficient of x2n+1 in the Taylor series expansion of sin(sin(x)).1, 3, 10, 315, 2520, 49896, 97297200, 638512875...
A359569Number of vertices after n iterations of constructing circles from all current vertices using only a compass, starting with one vertex. See the Comments.1, 2, 4, 14, 6562
A359570Number of regions after n iterations of constructing circles from all current vertices using only a compass, starting with one vertex. See the Comments.0, 1, 3, 21, 7169
A359571Number of edges after n iterations of constructing circles from all current vertices using only a compass, starting with one vertex. See the Comments.0, 1, 6, 34, 13730
A359578Dirichlet inverse of A336477, where A336477(n) = 1 if phi(n) is a power of 2, otherwise 0.1, -1, -1, 0, -1, 1, 0, 0...
A359579Dirichlet inverse of A336923, where A336923(n) = 1 if sigma(2n) - sigma(n) is a power of 2, otherwise 0.1, -1, -1, 0, 0, 1, -1, 0...
A359581a(n) = (-1)A329697(n).1, 1, -1, 1, -1, -1, 1, 1...
A359582a(n) is the least prime > a(n-2) such that a(n-1)+a(n) is a square.2, 2, 7, 29, 71, 73, 251, 149...
A359583Parity of A329697.0, 0, 1, 0, 1, 1, 0, 0...
A359584Positions of odd terms in A329697.3, 5, 6, 10, 12, 17, 19, 20...
A359585Positions of even terms in A329697.1, 2, 4, 7, 8, 9, 11, 13...
A359586Inverse Möbius transform of A359581.1, 2, 0, 3, 0, 0, 2, 4...
A359587Fully multiplicative with a(p) = A008578(1+A329697(p)).1, 1, 2, 1, 2, 2, 3, 1...
A359588Dirichlet inverse of A083346.1, -2, -3, 3, -5, 6, -7, -6...
A359589Dirichlet inverse of function f(n) = (-1 + gcd(A003415(n), A276086(n))), where A003415 is the arithmetic derivative and A276086 is the primorial base exp-function.1, 0, 0, 0, 0, -4, 0, -2...
A359590Absolute values of A355690, where A355690 is the Dirichlet inverse of the characteristic function of numbers not congruent to 2 mod 4.1, 0, 1, 1, 1, 0, 1, 1...
A359591Dirichlet inverse of A035263, where A035263(n) is parity of 2-adic valuation of 2n.1, 0, -1, -1, -1, 0, -1, 0...
A359592Parity (and also absolute values) of Dirichlet inverse of A035263, where A035263(n) is parity of 2-adic valuation of 2n.1, 0, 1, 1, 1, 0, 1, 0...
A359593Multiplicative with a(pe) = 1 if p divides e, pe otherwise.1, 2, 3, 1, 5, 6, 7, 8...
A359594Multiplicative with a(pe) = pe if p divides e, 1 otherwise.1, 1, 1, 4, 1, 1, 1, 1...
A359595Parity of A358777, where A358777 is Dirichlet inverse of the characteristic function of odd numbers with an even number of prime factors (counted with multiplicity).1, 0, 0, 0, 0, 0, 0, 0...
A359596Positions of odd terms in A358777.1, 9, 15, 21, 25, 33, 35, 39...
A359597Indices k such that A358777(k) is odd, and k is not an odd semiprime.1, 135, 189, 297, 315, 351, 375, 459...
A359598Indices of terms with record absolute values in A358777.1, 225, 315, 1155, 4725, 10395, 17325, 45045...
A359599Terms of A358777 with record absolute values.1, 2, 3, 5, -6, -11, -18, -33...
A359600The least odd number with the same prime signature as n.1, 3, 3, 9, 3, 15, 3, 27...
A359601Dirichlet inverse of A244042, where A244042(n) replaces 2's with 0's in the ternary representation of n.1, 0, -3, -4, -3, 0, -1, 0...
A359602Sum of A244042 and its Dirichlet inverse, where A244042(n) replaces 2's with 0's in the ternary representation of n.2, 0, 0, 0, 0, 0, 0, 0...
A359603Dirichlet inverse of function f(n) = 1+(A003415(n)*A276086(n)), where A003415 is the arithmetic derivative and A276086 is the primorial base exp-function.1, -4, -7, -21, -19, 30, -11, 51...
A359604a(n) = A359603(n) mod 60.1, 56, 53, 39, 41, 30, 49, 51...
A359605a(n) = 1 if A355690(n) is positive (+1), otherwise 0.1, 0, 0, 0, 0, 0, 0, 0...
A359606a(n) = 1 if A355690(n) is negative (-1), otherwise 0.0, 0, 1, 1, 1, 0, 1, 1...
A359607Terms of A046337 for which A358777 is zero, where the latter is the Dirichlet inverse of former's characteristic function.81, 625, 729, 1215, 1701, 2401, 2673, 3159...
A359608Indices k at which point A358777(k) obtains a new distinct value that has not occured before.1, 2, 9, 225, 315, 1155, 2835, 4725...
A359609Distinct values of A358777 in the order of their appearance.1, 0, -1, 2, 3, 5, -2, -6...
A359619Irregular table read by rows: T(n,k) is the number of k-gons, k>=1, after n iterations of constructing circles from all current vertices using only a compass, starting with one vertex. See the Comments.0, 1, 0, 0, 2, 1, 0, 1...
A359627Irregular table read by rows; the n-th row lists the divisors d of 2n such that the binary expansions of d and 2n have no common 1-bit.1, 1, 2, 1, 1, 2, 4, 1...
A359634a(0)=1 and thereafter a(n) is the length of the longest contiguous group of terms in the sequence thus far that add up to n; if no such group exists, set a(n)=0.1, 1, 2, 2, 3, 3, 4, 3...
A359635a(n) = A162657(n)/n.1, 1, 1, 1, 1, 3, 1, 1...
A359636a(n) is the least odd prime not in A001359 such that all subsequent composites in the gap up to the next prime have at least n distinct prime factors.7, 19, 643, 51427, 8083633, 1077940147, 75582271489
A359642Number of numbers <= 10n that are products of 4 distinct primes.0, 0, 16, 429, 7039, 92966, 1103888, 12364826...
A359643a(n) = Sum_{k=0..n} binomial(n,k) * binomial(4*k,k).1, 5, 37, 317, 2885, 27105, 259765, 2523813...
A359644Number of numbers <= 10n that are products of 5 distinct primes.0, 0, 0, 24, 910, 18387, 286758, 3884936...
A359645Number of numbers <= 10n that are products of 6 distinct primes.0, 0, 0, 0, 20, 1235, 32396, 605939...
A359646a(n) = Sum_{k=0..n} binomial(n,k) * binomial(5*n+k,k).1, 7, 89, 1273, 19181, 297662, 4707971, 75459496...
A359647a(n) = [xn] hypergeom([1/4, 3/4], [2], 64*x). The central terms of the Motzkin triangle A359364 without zeros.1, 6, 140, 4620, 180180, 7759752, 356948592, 17210021400...
A359649a(n) = hypergeom([(1 - n)/2, -n/2], [2], 4*n2).1, 1, 5, 28, 609, 6501, 272701, 4286815...
A359651Numbers with exactly three nonzero decimal digits and not ending with 0.111, 112, 113, 114, 115, 116, 117, 118...
A359652Lexicographically earliest sequence of positive integers such that no three terms a(j), a(j+k), a(j+2k) (for any j and k) form an arithmetic or geometric progression.1, 1, 2, 1, 1, 2, 2, 5...
A359653Number of regions formed in a square with edge length 1 by straight line segments when connecting the internal edge points that divide the sides into segments with lengths equal to the Farey series of order n to the equivalent points on the opposite side of the square.1, 4, 96, 728, 7840, 17744, 104136, 246108...
A359654Number of vertices formed in a square with edge length 1 by straight line segments when connecting the internal edge points that divide the sides into segments with lengths equal to the Farey series of order n to the equivalent points on the opposite side of the square.4, 9, 77, 593, 6749, 15569, 93281, 222933...
A359655Number of edges formed in a square with edge length 1 by straight line segments when connecting the internal edge points that divide the sides into segments with lengths equal to the Farey series of order n to the equivalent points on the opposite side of the square.4, 12, 172, 1320, 14588, 33312, 197416, 469040...
A359656Irregular table read by rows: T(n,k) is the number of k-gons, k>=3, formed in a square with edge length 1 by straight line segments when connecting the internal edge points that divide the sides into segments with lengths equal to the Farey series of order n to the equivalent points on the opposite side of the square.0, 1, 0, 4, 56, 40, 368, 300...
A359658a(n) = Sum_{k=0..n} kk * (n-k + 1).0, 1, 3, 12, 118, 3345, 337337, 117813304...
A359659a(n) = Sum_{k=0..n} kk * (n-k+1).1, 2, 6, 45, 1051, 88602, 27121964, 37004504305...
A359660a(n) = Sum_{k=0..n} k2 * (n-k + 1).0, 1, 3, 12, 64, 441, 3855, 41464...
A359661a(n) is the number of free convex polyominoes of n cells.1, 1, 2, 5, 11, 29, 72, 191...
A359662Number of (3-dimensional) cells of regular m-polytopes for m >= 3.1, 5, 8, 15, 16, 24, 35, 40...
A359663a(1) = 1; for n > 1, a(n) is the smallest positive number which has not appeared that shares a factor with the sum of the first n terms of the Champernowne string starting from 1.1, 3, 2, 4, 5, 6, 7, 8...
A359664Prime Maze Room 11, opposite parity of A059459 starting from prime room 11.11, 43, 41, 2089, 2081, 2083, 2087, 10889035741470030830827987437816582768679...
A359665a(n) = Sum_{k=0..n} binomial(k3, k).1, 2, 30, 2955, 638331, 235169606, 131748994154, 104332124742623...
A359667a(n) is the number of minimally prolific free polyominoes, i.e., that can generate the least possible number of children by adding a square.1, 1, 1, 1, 1, 1, 1, 5...
A359671a(n) = coefficient of xn in A(x) where 1 = Sum_{n=-oo..+oo} (xn - x*A(x))n.2, 4, 6, 6, 10, 78, 412, 1394...
A359672a(n) = coefficient of xn in A(x) where x = Sum_{n=-oo..+oo} (-1)n-1 * xn * (1 + xn*A(x)n)n.1, 1, 2, 5, 21, 72, 257, 998...
A359673a(n) = coefficient of xn in A(x) where 1 = Sum_{n=-oo..+oo} (2x + (-x)^nA(x)n)n.1, 2, 5, 13, 30, 74, 202, 616...
A359674Zero-based weighted sum of the prime indices of n in weakly increasing order.0, 0, 0, 1, 0, 2, 0, 3...
A359675Positions of first appearances in the sequence of zero-based weighted sums of prime indices (A359674).1, 4, 6, 8, 12, 14, 16, 20...
A359676Least positive integer whose weakly increasing prime indices have zero-based weighted sum n (A359674).1, 4, 6, 8, 14, 12, 16, 20...
A359677Zero-based weighted sum of the reversed (weakly decreasing) prime indices of n.0, 0, 0, 1, 0, 1, 0, 3...
A359679Least number with weighted sum of reversed (weakly decreasing) prime indices (A318283) equal to n.1, 2, 3, 4, 6, 10, 8, 12...
A359681Least positive integer whose reversed (weakly decreasing) prime indices have zero-based weighted sum (A359677) equal to n.1, 4, 9, 8, 18, 50, 16, 36...
A359682Least positive integer whose weakly increasing prime indices have weighted sum (A304818) equal to n.1, 2, 3, 4, 7, 6, 8, 10...
A359683Greatest positive integer whose reversed (weakly decreasing) prime indices have weighted sum (A318283) equal to n.1, 2, 3, 5, 7, 11, 14, 22...
A359684Greatest prime dividing 2n - n for n>=2; a(1) = 1.1, 2, 5, 3, 3, 29, 11, 31...
A359685Greatest prime dividing 2n + n.3, 3, 11, 5, 37, 7, 5, 11...
A359688a(n) is the number of asymmetrical polyiamonds of n cells.0, 0, 0, 0, 4, 10, 36, 94...
A359689a(n) is the number of free polyiamonds of n cells with chessboard coloring.2, 1, 2, 4, 8, 19, 48, 120...
A359690Number of vertices in a regular drawing of a complete bipartite graph where the vertex positions on each part equal the Farey series of order n.5, 13, 69, 289, 1971, 3997, 20371, 45751...
A359691Number of crossings in a regular drawing of a complete bipartite graph where the vertex positions on each part equal the Farey series of order n.1, 7, 59, 275, 1949, 3971, 20333, 45705...
A359692Number of regions in a regular drawing of a complete bipartite graph where the vertex positions on each part equal the Farey series of order n.2, 12, 94, 382, 2486, 4946, 24100, 53152...
A359693Number of edges in a regular drawing of a complete bipartite graph where the vertex positions on each part equal the Farey series of order n.6, 24, 162, 670, 4456, 8942, 44470, 98902...
A359694Irregular table read by rows: T(n,k) is the number of k-gons, k>=3, in a regular drawing of a complete bipartite graph where the vertex positions on each part equal the Farey series of order n.2, 10, 2, 70, 24, 218, 160, 4...
A359700a(n) = Sum_{dn} dd + n/d - 1.
A359701a(n) = Sum_{dn} dd + n/d - 2.
A359703Number of fillomino dissections of a 2 X n rectangle.1, 1, 5, 33, 138, 715, 3524, 17119...
A359705Cogrowth sequence of the Brin-Navas group B.1, 4, 28, 232, 2092, 19864, 195352, 1970896...
A359708a(n) is the greatest divisor d of 2n such that the binary expansions of d and 2n have no common 1-bit.1, 2, 1, 4, 5, 3, 1, 8...
A359709Number of n-step self-avoiding walks on a 2D square lattice whose end-to-end distance is an integer.1, 4, 4, 12, 28, 76, 164, 732...
A359710Order of shifts of Thue-Morse sequence.0, 1, 3, 0, 2, 1, 5, 3...
A359720T(n,k) = coefficient of xn*yk in A(x,y) such that: x = Sum_{n=-oo..+oo} (-1)n * xn * (y + xn)n * A(x,y)n.1, 1, 1, 2, 4, 5, 1, 7...
A359721a(n) = coefficient of xn in the power series A(x) such that: x = Sum_{n=-oo..+oo} (-1)n * xn * (1 + xn)n * A(x)n.1, 1, 3, 10, 37, 127, 460, 1710...
A359722a(n) = A359720(3n+1,2n) for n >= 0.1, 9, 54, 269, 1254, 5642, 24828, 107613...
A359723a(n) = coefficient of xn in the power series A(x) such that: x = Sum_{n=-oo..+oo} (-1)n * xn * (3 + xn)n * A(x)n.1, 1, 7, 28, 151, 803, 4108, 22532...
A359724a(n) = coefficient of xn in the power series A(x) such that: x = Sum_{n=-oo..+oo} (-1)n * xn * (4 + xn)n * A(x)n.1, 1, 9, 40, 235, 1456, 8323, 51510...
A359725a(n) = A359720(n+2,1), for n >= 0.2, 5, 21, 51, 170, 454, 1367, 3776...
A359726a(n) = A359720(n+3,2), for n >= 0.1, 9, 49, 179, 711, 2390, 8361, 27082...
A359728a(1) = 1; a(n) is the smallest positive number not among the first k terms where k is the number of times a(n-1) has occurred.1, 2, 2, 3, 2, 3, 3, 3...
A359729The number of Carmichael numbers smaller than the n-th Carmichael number which are quadratic residues of the n-th Carmichael number.0, 0, 0, 0, 0, 1, 1, 0...
A359730a(n) = Sum_{dn} 2d-1 * dn/d.
A359731a(n) = (1/2) * Sum_{dn} (2*d)d.
A359732a(n) = Sum_{dn} d2*d-1.
A359733a(n) = (1/2) * Sum_{dn} (2*d)n/d.
A359741Number of n-step self-avoiding walks on a 3D cubic lattice whose end-to-end distance is an integer.1, 6, 6, 30, 78, 1134, 1350, 20574...
A359742Viggo Brun's ternary continued fraction algorithm applied to { log 2, log 3/2, log 5/4 } produces a list of triples (p,q,r); sequence gives p values.2, 3, 5, 7, 12, 19, 31, 34...
A359743Viggo Brun's ternary continued fraction algorithm applied to { log 2, log 3/2, log 5/4 } produces a list of triples (p,q,r); sequence gives q values.1, 2, 3, 4, 7, 11, 18, 20...
A359744Viggo Brun's ternary continued fraction algorithm applied to { log 2, log 3/2, log 5/4 } produces a list of triples (p,q,r); sequence gives r values.1, 1, 2, 2, 4, 6, 10, 11...
A359745Numbers k such that k and k+1 have the same ordered prime signature.2, 14, 21, 33, 34, 38, 44, 57...
A359746Numbers k such that k, k+1 and k+2 have the same ordered prime signature.33, 85, 93, 141, 201, 213, 217, 301...
A359747Numbers k such that k*(k+1) has in its canonical prime factorization mutually distinct exponents.1, 3, 4, 7, 8, 16, 24, 27...
A359748Numbers k such that k and k+1 are both in A359747.3, 7, 71, 107, 242, 431, 1151, 2591...
A359749Numbers k such that k and k+1 do not share a common exponent in their prime factorizations.1, 3, 4, 7, 8, 9, 15, 16...
A359750Numbers that are a product of one or more factorials j!, j >= 2, in at least two ways.24, 48, 96, 144, 192, 288, 384, 576...
A359751Numbers that are a product of one or more factorials j!, j >= 2, in at least two ways such that no factorial > 1 appears in both products.24, 576, 720, 2880, 13824, 17280, 40320, 69120...
A359763Dirichlet inverse of A065043, where A065043 is the characteristic function of the numbers with an even number of prime factors (counted with multiplicity).1, 0, 0, -1, 0, -1, 0, 0...
A359764Parity of A359763, where A359763 is the Dirichlet inverse of characteristic function of the numbers with an even number of prime factors (counted with multiplicity).1, 0, 0, 1, 0, 1, 0, 0...
A359765Positions of odd terms in A359763, where A359763 is the Dirichlet inverse of characteristic function of the numbers with an even number of prime factors (counted with multiplicity).1, 4, 6, 9, 10, 14, 15, 21...
A359766Positions of even terms in A359763, where A359763 is the Dirichlet inverse of characteristic function of the numbers with an even number of prime factors (counted with multiplicity).2, 3, 5, 7, 8, 11, 12, 13...
A359767Numbers k such that A065043(k) = 1 but A359764(k) = 0, where A359764 is the parity of Dirichlet inverse of the former (which is the characteristic function of the numbers with an even number of prime factors).16, 36, 64, 81, 96, 100, 160, 196...
A359769a(n) = A353557(n) - A353556(n).1, -1, 0, 0, 0, 0, 0, -1...
A359770a(n) = 1 if n and bigomega(n) are of different parity, otherwise 0. Here bigomega (A001222) gives the number of prime factors of n with multiplicity.1, 1, 0, 0, 0, 0, 0, 1...
A359771Union of even numbers with an odd number of prime factors and odd numbers with an even number of prime factors, when the number of prime factors is counted with multiplicity.1, 2, 8, 9, 12, 15, 18, 20...
A359772Union of even numbers with an even number of prime factors and odd numbers with an odd number of prime factors, when the number of prime factors is counted with multiplicity.3, 4, 5, 6, 7, 10, 11, 13...
A359773Dirichlet inverse of A356163, where A356163 is the characteristic function of the numbers with an even sum of prime factors (counted with multiplicity).1, -1, 0, 0, 0, 0, 0, 0...
A359774Parity of A359773, where A359773 is the Dirichlet inverse of A356163.1, 1, 0, 0, 0, 0, 0, 0...
A359775Positions of odd terms in A359773, where A359773 is the Dirichlet inverse of A356163.1, 2, 9, 15, 18, 21, 25, 30...
A359776Positions of even terms in A359773, where A359773 is the Dirichlet inverse of A356163.3, 4, 5, 6, 7, 8, 10, 11...
A359777Numbers k such that A356163(k) = 1 but A359774(k) = 0, where A359774 is the parity of Dirichlet inverse of the former (which is the characteristic function of the numbers with an even sum of prime factors, with repetition).4, 8, 16, 32, 36, 60, 64, 72...
A359780Dirichlet inverse of A358680, where A358680 is the characteristic function of the numbers with even arithmetic derivative (A003415).1, 0, 0, -1, 0, 0, 0, -1...
A359781Parity of A359780, where A359780 is the Dirichlet inverse of the characteristic function of the numbers with even arithmetic derivative (A003415).1, 0, 0, 1, 0, 0, 0, 1...
A359782Positions of even terms in A359780.2, 3, 5, 6, 7, 10, 11, 13...
A359783Positions of odd terms in A359780.1, 4, 8, 9, 12, 15, 20, 21...
A359784Numbers k such that A358680(k) = 1 but A359781(k) = 0, where A359781 is the parity of Dirichlet inverse of the former (which is the characteristic function of the numbers with even arithmetic derivative).16, 81, 128, 192, 225, 240, 320, 324...
A359789Dirichlet inverse of A036288, where A036288(n) = 1 + sopfr(n), where sopfr is the sum of prime divisors with repetition, A001414.1, -3, -4, 4, -6, 18, -8, -4...
A359790Dirichlet inverse of function f(n) = 1 + n', where n' stands for the arithmetic derivative of n, A003415(n).1, -2, -2, -1, -2, 2, -2, -1...
A359791Dirichlet inverse of function f(n) = 1 + A349905(n), where A349905(n) is the arithmetic derivative of prime shifted n.1, -2, -2, -3, -2, -1, -2, -8...
A359792a(n) = (-1)A003415(n), where A003415 is the arithmetic derivative of n.1, -1, -1, 1, -1, -1, -1, 1...
A359793Dirichlet inverse of (-1)A003415(n), where A003415 is the arithmetic derivative of n.1, 1, 1, 0, 1, 3, 1, -2...
A359796a(n) = Sum_{dn} (2*d)d-1.
A359797Cogrowth sequence of the lamplighter group Z_2 ≀ Z where ≀ denotes the wreath product.1, 3, 15, 87, 547, 3623, 24885, 175591...
A359798Cogrowth sequence of the group Z ≀ Z where ≀ denotes the wreath product.1, 4, 28, 232, 2108, 20384, 206392, 2165720...
A359806Lexicographically earliest sequence of distinct positive terms such that for any n > 0 and any k > 0, floor((2k) / n) AND floor((2k) / a(n)) = 0 (where AND denotes the bitwise AND operator).2, 1, 6, 5, 4, 3, 14, 9...
A359808a(n) is the least prime factor of the alternating factorial n! - (n-1)! + (n-2)! - ... 1! for n > 2; a(1) = a(2) = 1.1, 1, 5, 19, 101, 619, 4421, 35899...
A359811a(n) = Sum_{dn} 2d-1 * dn/d-1.
A359812a(n) = Sum_{dn} (-1)d-1 * dn/d-1.
A359820a(n) = 1 if n and n' are of different parity, otherwise 0. Here n' stands for the arithmetic derivative of n, A003415(n).0, 1, 1, 0, 0, 0, 1, 0...
A359821Numbers k whose arithmetic derivative, A003415(k), has the opposite parity to k.1, 2, 6, 9, 10, 14, 15, 18...
A359822Numbers k whose arithmetic derivative, A003415(k), has the same parity as k.0, 3, 4, 5, 7, 8, 11, 12...
A359823Dirichlet inverse of A359820, where A359820 is the characteristic function of numbers whose parity differs from the parity of their arithmetic derivative (A003415).1, -1, 0, 1, 0, -1, 0, -1...
A359824Parity of A359823, where A359823 is the Dirichlet inverse of A359820.1, 1, 0, 1, 0, 1, 0, 1...
A359825Positions of odd terms in A359823, where A359823 is the Dirichlet inverse of A359820.1, 2, 4, 6, 8, 9, 10, 14...
A359839Numbers k such that k, k + 1 and k + 2 are 3 consecutive Niven (Harshad) numbers that are also divisible by a square.2023, 4912, 12103, 17575, 23273, 51424, 52675, 60399...
A359842a(n) = Sum_{k=0..n} binomial(n*k,n+k).1, 0, 1, 90, 13690, 3443275, 1308315371, 701623884514...
A359844a(n) = ((2*n+1)8 + 1)/2.1, 3281, 195313, 2882401, 21523361, 107179441, 407865361, 1281445313...

r/OEIS • • Oct 30 '22

New OEIS sequences - week of 10/30

4 Upvotes
OEIS numberDescriptionSequence
A356159Sum of the prime indices of the smallest number that has the same prime signature as n.0, 1, 1, 2, 1, 3, 1, 3...
A356322a(n) is the smallest number that starts a run of at most n consecutive numbers in A126706.12, 44, 98, 3174, 844, 22020, 217070, 1092747...
A357068Decimal expansion of the limit of A357063(k)/3k-1 as k goes to infinity.1, 5, 7, 7, 2, 2, 7, 9...
A357069Number of partitions of n into at most 4 distinct positive squares.1, 1, 0, 0, 1, 1, 0, 0...
A357099Second nontrivial square root of unity mod A033949(n), i.e., second smallest x > 1 such that x2 == 1 mod the n-th positive integer that does not have a primitive root.5, 7, 11, 9, 11, 13, 7, 15...
A357126a(n) is the smallest positive integer k such that k > n and A071364(k) = A071364(n).3, 5, 9, 7, 10, 11, 27, 25...
A357129Indices of records in A357052.0, 3, 4, 5, 7, 8, 9, 10...
A357195a(n) is the smallest palindrome of the form k*(2*n+k-1)/2 where k is a positive integer.1, 2, 3, 4, 5, 6, 7, 8...
A357261a(n) is the number of blocks in the bottom row after adding n blocks to the preceding structure of rows. See Comments and Example sections for more details.1, 3, 3, 3, 4, 1, 3, 1...
A357278Perimeters of primitive integer-sided triangles with angles A < B < C = 2*Pi/3 = 120 degrees.15, 28, 40, 66, 77, 91, 104, 126...
A357315Numbers m such that for all k < m, at least one of mk - 1 and mk + 1 is squarefree.1, 2, 3, 4, 5, 6, 7, 8...
A357353Frobenius number of A = (n, n+1, n+2, n+3, n+5, n+7, n+11, ...) for n>=2.1, 2, 3, 9, 10, 13, 14, 17...
A357409a(n) is the maximum number of positive numbers in a set of n consecutive positive or negative odd numbers such that the number of pairs that add to a power of 2 is maximal.1, 2, 3, 3, 4, 5, 5, 6...
A357565a(n) = 3Sum_{k = 0..n} binomial(n+k-1,k)2 + 2Sum_{k = 0..n} binomial(n+k-1,k)3.5, 10, 114, 2926, 109106, 4846260, 234488526, 11913003294...
A357566a(n) = ( Sum_{k = 0..n} binomial(n+k-1,k)2 )3 * ( Sum_{k = 0..n} binomial(n+k-1,k)3 )2.1, 32, 3556224, 4816142496896, 14260946236464636800, 62923492736113950202540032, 355372959542696519903013302282592, 2376354966106399942850054560101358877184...
A357574a(n) is the number of pairs that add to a power of 2 in a set of n consecutive positive or negative odd numbers including A357409(n) positive numbers.0, 1, 2, 4, 5, 7, 9, 11...
A357587If k > 1 and k divides DedekindPsi(k) then A358015(k)/2 is a term of this sequence.1, 4, 3, 8, 12, 16, 9, 24...
A357635Numbers k such that the half-alternating sum of the partition having Heinz number k is 1.2, 8, 24, 32, 54, 128, 135, 162...
A357671a(n) = Sum_{k = 0..n} ( binomial(n+k-1,k) + binomial(n+k-1,k)2 ).2, 4, 20, 166, 1812, 22504, 297362, 4067298...
A357672a(n) = Sum_{k = 0..n} binomial(n+k-1,k) * Sum_{k = 0..n} binomial(n+k-1,k)2.1, 4, 84, 2920, 121940, 5607504, 273908712, 13947188112...
A357673a(n) = 4Sum_{k = 0..2n} binomial(n+k-1,k) + 3Sum_{k = 0..2n} binomial(n+k-1,k)2.7, 21, 225, 5124, 162657, 5812521, 219004812, 8516056500...
A357674a(n) = ( Sum_{k = 0..2n} binomial(n+k-1,k) )4 * ( Sum_{k = 0..2n} binomial(n+k-1,k)2 )3.1, 2187, 8422734375, 202402468703748096, 9223976224194016590174375, 587835594121137662072707812564687, 46157429480574073282465608886521546620928, 4181198339699286332943143923058721957212160000000...
A357774Binary expansions of odd numbers with two zeros in their binary expansion.1001, 10011, 10101, 11001, 100111, 101011, 101101, 110011...
A357780Primes p such that changing, in p, all 1's to 2's we get semiprimes and changing all 1's to 3's we get triprimes.61, 199, 313, 421, 619, 661, 1033, 1163...
A357851Numbers k such that the half-alternating sum of the prime indices of k is 1.2, 8, 18, 32, 45, 50, 72, 98...
A357852Replace prime(k) with prime(k+2) in the prime factorization of n.1, 5, 7, 25, 11, 35, 13, 125...
A357853Fully multiplicative with a(prime(k)) = A000009(k+1).1, 1, 2, 1, 2, 2, 3, 1...
A357854Squarefree numbers with a divisor having the same sum of prime indices as their quotient.1, 30, 70, 154, 165, 210, 273, 286...
A357879Number of divisors of n with the same sum of prime indices as their quotient. Central column of A321144, taking gaps as 0's.1, 0, 0, 1, 0, 0, 0, 0...
A357884a(1)=0; if a(n-1) shares any digits with n-1, then a(n) = a(n-1) with all copies of digits from n-1 removed. Otherwise, a(n) = a(n-1) + (n-1).0, 1, 3, 0, 4, 9, 15, 22...
A357928a(n) is the smallest c for which (s+c)2-n is a square, where s = floor(sqrt(n)), or -1 if no such c exists.0, 0, -1, 1, 0, 1, -1, 2...
A357948Expansion of e.g.f. exp( x * exp(-x2) ).1, 1, 1, -5, -23, 1, 601, 2731...
A357961a(1) = 1, and for any n > 0, a(n+1) is the k-th positive number not yet in the sequence, where k is the Hamming weight of a(n).1, 2, 3, 5, 6, 7, 9, 8...
A357969Decimal expansion of the constant Sum_{j>=0} j!/prime(j)#, where prime(j)# indicates the j-th primorial number.2, 2, 4, 0, 0, 5, 3, 6...
A357976Numbers with a divisor having the same sum of prime indices as their quotient.1, 4, 9, 12, 16, 25, 30, 36...
A357977Replace prime(k) with prime(A000041(k)) in the prime factorization of n.1, 2, 3, 4, 5, 6, 11, 8...
A357978Replace prime(k) with prime(A000009(k)) in the prime factorization of n.1, 2, 2, 4, 3, 4, 3, 8...
A357979Second MTF-transform of A000041. Replace prime(k) with prime(A357977(k)) in the prime factorization of n.1, 2, 3, 4, 5, 6, 7, 8...
A357980Replace prime(k) with prime(A000720(k)) in the prime factorization of n, assuming prime(0) = 1.1, 1, 2, 1, 3, 2, 3, 1...
A357981Numbers whose prime indices have only prime numbers as their own prime indices.1, 2, 4, 5, 8, 10, 11, 16...
A357982Replace prime(k) with A000009(k) in the prime factorization of n.1, 1, 1, 1, 2, 1, 2, 1...
A357983Second MTF-transform of the primes (A000040). Replace prime(k) with prime(A064988(k)) in the prime factorization of n.1, 2, 5, 4, 11, 10, 23, 8...
A357984Replace prime(k) with A000720(k) in the prime factorization of n.1, 0, 1, 0, 2, 0, 2, 0...
A357985Counterclockwise square spiral constructed using the integers so that a(n) plus all other numbers currently visible from the current number equals n; start with a(0) = 0.0, 1, 1, 1, 2, 1, 3, -1...
A357987Lexicographically earliest sequence of positive integers such that no sum of consecutive terms is a square or higher power of an integer.2, 3, 2, 5, 5, 2, 3, 2...
A357989Lexicographically earliest sequence of distinct numbers such that every sum of consecutive terms is an evil number (A001969).0, 3, 6, 9, 15, 24, 29, 43...
A357991Lexicographically earliest counterclockwise square spiral constructed using the nonnegative integers so that a(n) plus all other numbers currently visible from the current number form a distinct sum; start with a(0) = 0.0, 1, 1, 1, 2, 1, 3, 0...
A357993a(n) is the unique k such that A357961(k) = 2n.1, 2, 9, 8, 17, 34, 64, 129...
A358003Least composite number k such that there are n digits in the intersection of the sets of digits of k and of the juxtaposition of prime factors of k (apart from multiplicity).4, 12, 95, 132, 1972, 12305, 104392, 1026934...
A358005Number of partitions of n into 5 distinct positive Fibonacci numbers (with a single type of 1).1, 0, 0, 0, 0, 1, 0, 0...
A358006Number of partitions of n into 6 distinct positive Fibonacci numbers (with a single type of 1).1, 0, 0, 0, 0, 0, 0, 0...
A358007Number of partitions of n into 7 distinct positive Fibonacci numbers (with a single type of 1).1, 0, 0, 0, 0, 0, 0, 0...
A358008Number of partitions of n into 8 distinct positive Fibonacci numbers (with a single type of 1).1, 0, 0, 0, 0, 0, 0, 0...
A358009Number of partitions of n into at most 4 distinct prime parts.1, 0, 1, 1, 0, 2, 0, 2...
A358010Number of partitions of n into at most 5 distinct prime parts.1, 0, 1, 1, 0, 2, 0, 2...
A358011Number of partitions of n into at most 6 distinct prime parts.1, 0, 1, 1, 0, 2, 0, 2...
A358013Expansion of e.g.f. 1/(1 - x2 * (exp(x) - 1)).1, 0, 0, 6, 12, 20, 750, 5082...
A358014Expansion of e.g.f. 1/(1 - x3 * (exp(x) - 1)).1, 0, 0, 0, 24, 60, 120, 210...
A358015a(n) = DedekindPsi(n*2-k)*2j-1 where k = valuation(n, 2) and j = k if 4 divides n and otherwise 0.2, 2, 3, 2, 4, 4, 6, 3...
A358016a(n) is the largest k <= n-2 such that k2 == 1 (mod n).1, 1, 1, 1, 1, 5, 1, 1...
A358017Numbers n such that factorizations of n..n+8 have same number of primes (including multiplicities).3405122, 12788342, 17521382, 21991382, 22715270, 22841702, 22914722, 23553171...
A358018Numbers n such that factorizations of n..n+9 have same number of primes (including multiplicities).49799889, 60975410, 92017202, 202536181, 202536182, 249221990, 284007602, 314623105...
A358019Numbers n such that factorizations of n..n+10 have same number of primes (including multiplicities).202536181, 913535284, 1124342785, 1443929905, 1587749041, 1688485665, 1733574769, 2090053141...
A358020Least prime number > prime(n) (n >= 5) whose set of decimal digits coincides with the set of decimal digits of prime(n), or -1 if no such prime exists.1111111111111111111, 31, 71, 191, 223, 229, 113, 73...
A358021Lexicographically earliest sequence of distinct nonnegative integers on a square spiral such that no number shares a digit with any of its eight surrounding neighbors.0, 1, 2, 3, 4, 5, 6, 7...
A358031Expansion of e.g.f. (1 - log(1-x))/(1 + log(1-x) * (1 - log(1-x))).1, 2, 8, 52, 450, 4878, 63474, 963744...
A358032Expansion of e.g.f. (1 + log(1+x))/(1 - log(1+x) * (1 + log(1+x))).1, 2, 4, 16, 66, 438, 2694, 25296...
A358033a(1) = 2; a(n) - a(n-1) = A093803(a(n-1)), the largest odd proper divisor of a(n-1).2, 3, 4, 5, 6, 9, 12, 15...
A358034Numbers k such that A234575(k,s) = s2 where s = A007953(k).1, 113, 313, 331, 512, 1271, 2065, 2137...
A358038Partial sums of the cubefree numbers.1, 3, 6, 10, 15, 21, 28, 37...
A358039a(n) is the Euler totient function phi applied to the n-th cubefree number.1, 1, 2, 2, 4, 2, 6, 6...
A358040a(n) is the number of divisors of the n-th cubefree number.1, 2, 2, 3, 2, 4, 2, 3...
A358048Lexicographically earliest sequence of distinct nonnegative integers on a square spiral such that every number shares a digit with each of its eight surrounding neighbors.0, 10, 20, 30, 40, 50, 60, 70...
A358056Given a row of n payphones (or phone booths), all initially unused, how many ways are there for n people to choose the payphones, assuming each always chooses one of the most distant payphones from those in use already? We consider here only the distance to the closest neighbor (in contrast to A095236).1, 1, 2, 4, 8, 20, 48, 216...
A358057Inverse permutation to A357961.1, 2, 3, 9, 4, 5, 6, 8...
A358061a(n) = phi(n) mod tau(n).0, 1, 0, 2, 0, 2, 0, 0...
A358063Expansion of e.g.f. exp( x * exp(-x3) ).1, 1, 1, 1, -23, -119, -359, 1681...
A358064Expansion of e.g.f. 1/(1 - x * exp(x2)).1, 1, 2, 12, 72, 540, 5040, 53760...
A358065Expansion of e.g.f. 1/(1 - x * exp(x3)).1, 1, 2, 6, 48, 360, 2880, 27720...
A358068Numbers that share a (decimal) digit with the sum of their proper divisors.6, 11, 12, 13, 14, 16, 17, 18...
A358078a(n) is the number of squarefree semiprimes <= 2n.0, 0, 0, 1, 4, 7, 18, 37...
A358080Expansion of e.g.f. 1/(1 - x2 * exp(x)).1, 0, 2, 6, 36, 260, 2190, 21882...
A358081Expansion of e.g.f. 1/(1 - x3 * exp(x)).1, 0, 0, 6, 24, 60, 840, 10290...
A358091Triangle read by rows. Coefficients of the polynomials P(n, x) = 2n-2(3n-1)* hypergeometric([-3*n, 1 - n, -n + 4/3], [-n, -n + 1/3], x). T(n, k) = [xk] P(n, x).1, 5, -6, 16, -60, 48, 44, -288...
A358092Row sums of the convolution triangle of the Motzkin numbers (A202710).1, 1, 3, 9, 28, 88, 279, 889...
A358093Row sums of the convolution triangle based on positive integers repeated (A060086).1, 1, 2, 5, 11, 25, 56, 126...
A358098a(n) is the largest integer m < n such that m and n have no common digit, or -1 when such integer m does not exist.0, 1, 2, 3, 4, 5, 6, 7...
A358111The multiplicative inverse of the coefficients of the factorially normalized Bernoulli polynomials (provided they do not vanish, otherwise by convention 0).1, -2, 1, 12, -2, 2, 0, 12...

r/OEIS • • Dec 13 '20

How do I add to OEIS if I’m underage

5 Upvotes

I have a good idea for a sequence that has to do with logarithms and exponents of 2 (not saying exactly so others don’t steal), but I’m under 18.

What should I do?


r/OEIS • • Feb 11 '23

A002522

Post image
16 Upvotes

r/OEIS • • Apr 04 '23

Me introducting a friend to OEIS

Post image
17 Upvotes

and yes oeis did have it :)


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 • • 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 • • 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 • • 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 • • Jan 07 '21

Should I learn PARI?

6 Upvotes

Seems like every other entry has a PARI 1-liner.


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 • • Apr 23 '23

New OEIS sequences - week of 04/23

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

r/OEIS • • Apr 06 '23

New OEIS sequences - week of 04/02

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

r/OEIS • • Apr 11 '23

New OEIS sequences - week of 04/09

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

r/OEIS • • Apr 16 '23

New OEIS sequences - week of 04/16

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

r/OEIS • • May 06 '23

Sequences with cool graphs

6 Upvotes

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


r/OEIS • • May 14 '23

New OEIS sequences - week of 05/14

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

r/OEIS • • May 07 '23

New OEIS sequences - week of 05/07

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