Sequences
392,541 sequences
- Number of increasing mobiles (circular rooted trees) with n nodes and 7 leaves.A055361
Number of increasing mobiles (circular rooted trees) with n nodes and 7 leaves.
- Number of increasing mobiles (circular rooted trees) with n nodes and 8 leaves.A055362
Number of increasing mobiles (circular rooted trees) with n nodes and 8 leaves.
- Triangle of asymmetric mobiles (circular rooted trees) with n nodes and k leaves.A055363
Triangle of asymmetric mobiles (circular rooted trees) with n nodes and k leaves.
- Number of asymmetric mobiles (circular rooted trees) with n nodes and 3 leaves.A055364
Number of asymmetric mobiles (circular rooted trees) with n nodes and 3 leaves.
- Number of asymmetric mobiles (circular rooted trees) with n nodes and 4 leaves.A055365
Number of asymmetric mobiles (circular rooted trees) with n nodes and 4 leaves.
- Number of asymmetric mobiles (circular rooted trees) with n nodes and 5 leaves.A055366
Number of asymmetric mobiles (circular rooted trees) with n nodes and 5 leaves.
- Number of asymmetric mobiles (circular rooted trees) with n nodes and 6 leaves.A055367
Number of asymmetric mobiles (circular rooted trees) with n nodes and 6 leaves.
- Number of asymmetric mobiles (circular rooted trees) with n nodes and 7 leaves.A055368
Number of asymmetric mobiles (circular rooted trees) with n nodes and 7 leaves.
- Number of asymmetric mobiles (circular rooted trees) with n nodes and 8 leaves.A055369
Number of asymmetric mobiles (circular rooted trees) with n nodes and 8 leaves.
- Matrix inverse of triangle A055363(n+2,k).A055370
Matrix inverse of triangle A055363(n+2,k).
- Column 1 of triangle A055370.A055371
Column 1 of triangle A055370.
- Invert transform of Pascal's triangle A007318.A055372
Invert transform of Pascal's triangle A007318.
- Invert transform applied twice to Pascal's triangle A007318.A055373
Invert transform applied twice to Pascal's triangle A007318.
- Invert transform applied three times to Pascal's triangle A007318.A055374
Invert transform applied three times to Pascal's triangle A007318.
- Euler transform of Pascal's triangle A007318.A055375
Euler transform of Pascal's triangle A007318.
- CIK transform of Pascal's triangle A007318.A055376
CIK transform of Pascal's triangle A007318.
- a(n) = largest prime <= n/2.A055377
a(n) = largest prime <= n/2.
- Table read by antidiagonals: T(n,k) = n^trinv(k)+n^(k-((trinv(k)*(trinv(k)-1))/2)) where trinv (k) = floor((1+sqrt(1+8*k))/2) and with 0^0 = 1.A055378
Table read by antidiagonals: T(n,k) = n^trinv(k)+n^(k-((trinv(k)*(trinv(k)-1))/2)) where trinv (k) = floor((1+sqrt(1+8*k))/2) and with 0^0 = 1.
- 16*a(n) gives theta series of the shadow of the 24-dimensional odd Leech lattice.A055379
16*a(n) gives theta series of the shadow of the 24-dimensional odd Leech lattice.
- Central prime p in the smallest (2n+1)-tuple of consecutive primes that are symmetric with respect to p.A055380
Central prime p in the smallest (2n+1)-tuple of consecutive primes that are symmetric with respect to p.
- Smallest composite k such that the n closest primes below and above k are symmetric about k.A055381
Smallest composite k such that the n closest primes below and above k are symmetric about k.
- Smallest prime starting a sequence of 2n consecutive odd primes with symmetrical gaps about the center.A055382
Smallest prime starting a sequence of 2n consecutive odd primes with symmetrical gaps about the center.
- Expansion of (1+3*x+9*x^2+12*x^3+11*x^4+3*x^5+x^6)/((1-x)^2*(1-x^2)^2*(1-x^3)).A055383
Expansion of (1+3*x+9*x^2+12*x^3+11*x^4+3*x^5+x^6)/((1-x)^2*(1-x^2)^2*(1-x^3)).
- Expansion of (1 + 4*x + 14*x^2 + 34*x^3 + 63*x^4 + 80*x^5 + 87*x^6 + 68*x^7 + 42*x^8 + 20*x^9 + 7*x^10) / ((1 - x)*(1 - x^2)^2*(1 - x^3)^2*(1 - x^4)).A055384
Expansion of (1 + 4*x + 14*x^2 + 34*x^3 + 63*x^4 + 80*x^5 + 87*x^6 + 68*x^7 + 42*x^8 + 20*x^9 + 7*x^10) / ((1 - x)*(1 - x^2)^2*(1 - x^3)^2*(1 - x^4)).
- Smallest prime factor of n^n + 1.A055385
Smallest prime factor of n^n + 1.
- Smallest factor of (2n)^(2n) + 1.A055386
Smallest factor of (2n)^(2n) + 1.
- 2, 3, 5, 7, together with primes such that there is a nontrivial rearrangement of the digits which is a prime.A055387
2, 3, 5, 7, together with primes such that there is a nontrivial rearrangement of the digits which is a prime.
- Number of riffle shuffles of 2n cards required to return the deck to its initial state.A055388
Number of riffle shuffles of 2n cards required to return the deck to its initial state.
- a(0) = 1, then twice the Fibonacci sequence.A055389
a(0) = 1, then twice the Fibonacci sequence.
- Terms of A007634 where n - 40 is not a square.A055390
Terms of A007634 where n - 40 is not a square.
- Palindromic Lucas numbers (in the order of appearance).A055391
Palindromic Lucas numbers (in the order of appearance).
- Number of bracketings of 0#0#0#...#0 giving result 0, where 0#0 = 1, 0#1 = 1#0 = 1#1 = 0.A055392
Number of bracketings of 0#0#0#...#0 giving result 0, where 0#0 = 1, 0#1 = 1#0 = 1#1 = 0.
- Sum of a square and a nonnegative cube in more than one way.A055393
Sum of a square and a nonnegative cube in more than one way.
- Numbers that are the sum of a positive square and a positive cube.A055394
Numbers that are the sum of a positive square and a positive cube.
- Number of bracketings of 0#0#0#...#0 giving result 0, where 0#0 = 0#1 = 1#0 = 1, 1#1 = 0.A055395
Number of bracketings of 0#0#0#...#0 giving result 0, where 0#0 = 0#1 = 1#0 = 1, 1#1 = 0.
- Smallest prime dividing n is a(n)-th prime (a(1)=0).A055396
Smallest prime dividing n is a(n)-th prime (a(1)=0).
- Maximum population of an n X n stable pattern in Conway's Game of Life.A055397
Maximum population of an n X n stable pattern in Conway's Game of Life.
- Result of fourth stage of sieve of Eratosthenes (after eliminating multiples of 2, 3, 5, 7).A055398
Result of fourth stage of sieve of Eratosthenes (after eliminating multiples of 2, 3, 5, 7).
- Number of stages of sieve of Eratosthenes needed to identify n as prime or composite.A055399
Number of stages of sieve of Eratosthenes needed to identify n as prime or composite.
- Cube excess: difference between n and largest cube <= n.A055400
Cube excess: difference between n and largest cube <= n.
- Number of positive cubes needed to sum to n using the greedy algorithm.A055401
Number of positive cubes needed to sum to n using the greedy algorithm.
- Least number represented as the sum of n cubes with greedy algorithm.A055402
Least number represented as the sum of n cubes with greedy algorithm.
- Number of points in N^4 of norm <= n.A055403
Number of points in N^4 of norm <= n.
- Number of points in N^5 of norm <= n.A055404
Number of points in N^5 of norm <= n.
- Number of points in N^6 of norm <= n.A055405
Number of points in N^6 of norm <= n.
- Number of points in N^7 of norm <= n.A055406
Number of points in N^7 of norm <= n.
- Number of points in N^8 of norm <= n.A055407
Number of points in N^8 of norm <= n.
- Number of points in N^9 of norm <= n.A055408
Number of points in N^9 of norm <= n.
- Number of points in N^10 of norm <= n.A055409
Number of points in N^10 of norm <= n.
- Number of points in Z^4 of norm <= n.A055410
Number of points in Z^4 of norm <= n.