Sequences
392,541 sequences
- Orbit size of each tree encoded by A014486(n) under Meeussen's bf<->df map on binary trees.A080311
Orbit size of each tree encoded by A014486(n) under Meeussen's bf<->df map on binary trees.
- Positions of A080313 in A014486.A080312
Positions of A080313 in A014486.
- Breadth-first-wise A014486-like encoding of A080299-trees.A080313
Breadth-first-wise A014486-like encoding of A080299-trees.
- Breadth-first-wise A063171-like-encoding of A080299-trees.A080314
Breadth-first-wise A063171-like-encoding of A080299-trees.
- a(n) = A080313(n)/2.A080315
a(n) = A080313(n)/2.
- a(n) = A080315(n) - 2^A000523(A080315(n)), i.e., the terms of A080315 without their most significant bit.A080316
a(n) = A080315(n) - 2^A000523(A080315(n)), i.e., the terms of A080315 without their most significant bit.
- a(n) = A007088(A080316(n)).A080317
a(n) = A007088(A080316(n)).
- Breadth-first-wise A014486-like encoding of the branch-reduced binomial-mod-2 binary trees (A080293).A080318
Breadth-first-wise A014486-like encoding of the branch-reduced binomial-mod-2 binary trees (A080293).
- Breadth-first-wise A063171-like-encoding of the branch-reduced binomial-mod-2 binary trees (A080294).A080319
Breadth-first-wise A063171-like-encoding of the branch-reduced binomial-mod-2 binary trees (A080294).
- a(n) = A057118(A080295(n)) = A080300(A080318(n)). Positions of A080318 in A014486.A080320
a(n) = A057118(A080295(n)) = A080300(A080318(n)). Positions of A080318 in A014486.
- a(n) = A080301(A080318(n)).A080321
a(n) = A080301(A080318(n)).
- Determinant of the n X n tridiagonal matrix M with the elements on the diagonals equal to 1, except M(n,n-1)=M(n-1,n)=n.A080322
Determinant of the n X n tridiagonal matrix M with the elements on the diagonals equal to 1, except M(n,n-1)=M(n-1,n)=n.
- a(n) = mu(n)^n, where mu is the Moebius function (A008683).A080323
a(n) = mu(n)^n, where mu is the Moebius function (A008683).
- Union of even squarefree numbers (A039956) and squarefree numbers for which the number of prime factors is even (A030229).A080324
Union of even squarefree numbers (A039956) and squarefree numbers for which the number of prime factors is even (A030229).
- a(n) = ((n+1)!*(2*n+1)!/4) * [x^(2*n-2)] 1/sin(x)^2.A080325
a(n) = ((n+1)!*(2*n+1)!/4) * [x^(2*n-2)] 1/sin(x)^2.
- Denominator of Sum(k^mu(k): 1<=k<=n), where mu is the Moebius function (A008683).A080326
Denominator of Sum(k^mu(k): 1<=k<=n), where mu is the Moebius function (A008683).
- Numbers k for which Lucas(k) and Fibonacci(k) are both prime.A080327
Numbers k for which Lucas(k) and Fibonacci(k) are both prime.
- Smaller of the two Ulam numbers that sum to the n-th Ulam number.A080328
Smaller of the two Ulam numbers that sum to the n-th Ulam number.
- Larger of the two Ulam numbers that sum to the n-th Ulam number.A080329
Larger of the two Ulam numbers that sum to the n-th Ulam number.
- Index in A002858 of the smaller of the two Ulam numbers that sum to the n-th Ulam number.A080330
Index in A002858 of the smaller of the two Ulam numbers that sum to the n-th Ulam number.
- Index in A002858 of the larger of the two Ulam numbers that sum to the n-th Ulam number.A080331
Index in A002858 of the larger of the two Ulam numbers that sum to the n-th Ulam number.
- G.f.: Product_{n>0} (1 - x^n)^3 * (1 - x^(2*n - 1))^2 = Sum_{n in Z} (6*n + 1) * x^(n*(3*n + 1)/2).A080332
G.f.: Product_{n>0} (1 - x^n)^3 * (1 - x^(2*n - 1))^2 = Sum_{n in Z} (6*n + 1) * x^(n*(3*n + 1)/2).
- Partial sums of A080278.A080333
Partial sums of A080278.
- n^2 read backwards, for n = 51, 50, 49, ..., 1.A080334
n^2 read backwards, for n = 51, 50, 49, ..., 1.
- Diagonal in square spiral or maze arrangement of natural numbers.A080335
Diagonal in square spiral or maze arrangement of natural numbers.
- Partial sums of A007001.A080336
Partial sums of A007001.
- Bisection of A080107.A080337
Bisection of A080107.
- Product of consecutive previous terms (starting with 2,3).A080338
Product of consecutive previous terms (starting with 2,3).
- Characteristic function of {1} union {primes}: 1 if n is 1 or a prime, else 0.A080339
Characteristic function of {1} union {primes}: 1 if n is 1 or a prime, else 0.
- First known infinite sequence containing no odd integer of the form 2^m+p (p prime).A080340
First known infinite sequence containing no odd integer of the form 2^m+p (p prime).
- Sum of the first n terms that are congruent to 1, 4 or 5 mod 6 (A047259).A080341
Sum of the first n terms that are congruent to 1, 4 or 5 mod 6 (A047259).
- Number of weighings required to identify a single bad coin out of n coins, using a two-pan balance.A080342
Number of weighings required to identify a single bad coin out of n coins, using a two-pan balance.
- a(n) = round(sqrt(2*n)) - floor(sqrt(2*n)).A080343
a(n) = round(sqrt(2*n)) - floor(sqrt(2*n)).
- Partial sums of A023969.A080344
Partial sums of A023969.
- a(n) is the number of prime factors in Fibonacci(prime(n)); that is, in the Fibonacci number whose index is the n-th prime.A080345
a(n) is the number of prime factors in Fibonacci(prime(n)); that is, in the Fibonacci number whose index is the n-th prime.
- First card number to reach the top of the deck n times in Guy's shuffle (see A035485).A080346
First card number to reach the top of the deck n times in Guy's shuffle (see A035485).
- Number of shuffles in Guy's shuffle (A035485) corresponding to the terms in A080346.A080347
Number of shuffles in Guy's shuffle (A035485) corresponding to the terms in A080346.
- Costé prime expansion of Catalan's constant.A080348
Costé prime expansion of Catalan's constant.
- Costé prime expansion of Pi-e.A080349
Costé prime expansion of Pi-e.
- Costé prime expansion of 1/Pi.A080350
Costé prime expansion of 1/Pi.
- Costé prime expansion of 1/exp(1).A080351
Costé prime expansion of 1/exp(1).
- Partial sums of A080343.A080352
Partial sums of A080343.
- a(1)=5; for n>1, a(n)=a(n-1)+1 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.A080353
a(1)=5; for n>1, a(n)=a(n-1)+1 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.
- First differences of A080353.A080354
First differences of A080353.
- a(1)=1; thereafter, a(n+1) = a(n) + 2^(prime(n)-1).A080355
a(1)=1; thereafter, a(n+1) = a(n) + 2^(prime(n)-1).
- Number of twin primes between n and 2n: a(n) = number of j in range n <= j <= 2*n such that j and j+2 are primes.A080356
Number of twin primes between n and 2n: a(n) = number of j in range n <= j <= 2*n such that j and j+2 are primes.
- Smallest x such that between x and 2x exactly n twin prime numbers can be found.A080357
Smallest x such that between x and 2x exactly n twin prime numbers can be found.
- Value of Vandermonde determinant for the first n prime numbers: V[prime(1), ..., prime(n)].A080358
Value of Vandermonde determinant for the first n prime numbers: V[prime(1), ..., prime(n)].
- The smallest integer x > 0 such that the number of primes in (x/2, x] equals n.A080359
The smallest integer x > 0 such that the number of primes in (x/2, x] equals n.
- a(n) is the largest positive integer x such that the number of unitary-prime-divisors of x! equals n. Same as the largest positive integer x such that the number of primes in (x/2,x] equals n.A080360
a(n) is the largest positive integer x such that the number of unitary-prime-divisors of x! equals n. Same as the largest positive integer x such that the number of primes in (x/2,x] equals n.