Sequences
392,541 sequences
- a(n+1) = a(n) + sum of digits of a(n)^3.A051411
a(n+1) = a(n) + sum of digits of a(n)^3.
- a(n+1) = a(n) + sum of digits of a(n)^3.A051412
a(n+1) = a(n) + sum of digits of a(n)^3.
- a(n+1) = a(n) + sum of digits of (a(n)^3).A051413
a(n+1) = a(n) + sum of digits of (a(n)^3).
- a(n+1) = a(n) + sum of digits of a(n)^3.A051414
a(n+1) = a(n) + sum of digits of a(n)^3.
- Numbers not of form n + sum of digits of n^3.A051415
Numbers not of form n + sum of digits of n^3.
- Primes whose digits are composite; primes having only {4, 6, 8, 9} as digits.A051416
Primes whose digits are composite; primes having only {4, 6, 8, 9} as digits.
- Quotients of consecutive values of lcm {1, 3, 5 ..., 2n-1} or A025547(n+1)/A025547(n).A051417
Quotients of consecutive values of lcm {1, 3, 5 ..., 2n-1} or A025547(n+1)/A025547(n).
- Square of LCM of {1, 2, ..., n}.A051418
Square of LCM of {1, 2, ..., n}.
- Local stops on New York City 1 Train (Broadway-7 Avenue Local) subway, but with 33rd St instead of 34th St.A051419
Local stops on New York City 1 Train (Broadway-7 Avenue Local) subway, but with 33rd St instead of 34th St.
- Numbers k such that A000081(k) is prime.A051420
Numbers k such that A000081(k) is prime.
- Number of digraphs on n unlabeled nodes with a sink (or, with a source).A051421
Number of digraphs on n unlabeled nodes with a sink (or, with a source).
- Nearest integer to cosecant(n).A051422
Nearest integer to cosecant(n).
- Numbers k such that the sum of prime divisors of k is congruent to 2^k (mod k).A051423
Numbers k such that the sum of prime divisors of k is congruent to 2^k (mod k).
- Number of partitions of n into pairwise relatively prime parts.A051424
Number of partitions of n into pairwise relatively prime parts.
- (Terms in A029665)/2.A051425
(Terms in A029665)/2.
- Least common multiple of {2, 4, 6, ..., 2n}.A051426
Least common multiple of {2, 4, 6, ..., 2n}.
- Number of strictly Deza graphs with n nodes.A051427
Number of strictly Deza graphs with n nodes.
- (Terms in A029658)/2.A051428
(Terms in A029658)/2.
- (Terms in A029659)/2.A051429
(Terms in A029659)/2.
- (Terms in A029661)/2.A051430
(Terms in A029661)/2.
- a(n) = (n+10)!/10!.A051431
a(n) = (n+10)!/10!.
- (Terms in A029617)/2.A051432
(Terms in A029617)/2.
- (Terms in A029605)/2.A051433
(Terms in A029605)/2.
- (Terms in A029607)/2.A051434
(Terms in A029607)/2.
- (Terms in A029613)/2.A051435
(Terms in A029613)/2.
- Number of undirected walks of length n+1 on tetrahedron, visiting n+2 vertices, with n "corners", as in A001998, but allowing only rigid motions in 3-space (|G| = 12). Walks are not self-avoiding.A051436
Number of undirected walks of length n+1 on tetrahedron, visiting n+2 vertices, with n "corners", as in A001998, but allowing only rigid motions in 3-space (|G| = 12). Walks are not self-avoiding.
- Number of undirected walks of length n+1 on an oriented triangle, visiting n+2 vertices, with n "corners"; the symmetry group is C3. Walks are not self-avoiding.A051437
Number of undirected walks of length n+1 on an oriented triangle, visiting n+2 vertices, with n "corners"; the symmetry group is C3. Walks are not self-avoiding.
- a(n) = prime(2^n - 1).A051438
a(n) = prime(2^n - 1).
- a(n) = prime(2^n + 1).A051439
a(n) = prime(2^n + 1).
- a(n) = prime(2^n) + 1.A051440
a(n) = prime(2^n) + 1.
- 4^3^2^1, 5^4^3, 6^5, 7.A051441
4^3^2^1, 5^4^3, 6^5, 7.
- a(n) = n^(n+1)+(n+1)^n.A051442
a(n) = n^(n+1)+(n+1)^n.
- a(n) = n^(n+1)*(n+1)^n.A051443
a(n) = n^(n+1)*(n+1)^n.
- Smallest k such that sigma(k) = n, or 0 if there is no such k, where sigma = A000203 = sum of divisors.A051444
Smallest k such that sigma(k) = n, or 0 if there is no such k, where sigma = A000203 = sum of divisors.
- Smallest k such that phi(k) = 2n, or 0 if there is no such k.A051445
Smallest k such that phi(k) = 2n, or 0 if there is no such k.
- Integers n such that 2^n == 13 (mod n).A051446
Integers n such that 2^n == 13 (mod n).
- Integers n such that 2^n == 9 (mod n).A051447
Integers n such that 2^n == 9 (mod n).
- Sum of prime divisors of n (with multiplicity) is a square.A051448
Sum of prime divisors of n (with multiplicity) is a square.
- Number of fibered rational knots with n crossings.A051449
Number of fibered rational knots with n crossings.
- Number of positive rational knots with 2n+1 crossings.A051450
Number of positive rational knots with 2n+1 crossings.
- a(n) = lcm{ 1,2,...,x } where x is the n-th prime power (A000961).A051451
a(n) = lcm{ 1,2,...,x } where x is the n-th prime power (A000961).
- a(n) = 1 + lcm(1..k) where k is the n-th prime power A000961(n).A051452
a(n) = 1 + lcm(1..k) where k is the n-th prime power A000961(n).
- Prime powers such that 1 + lcm(1,2,...,p^w) is prime.A051453
Prime powers such that 1 + lcm(1,2,...,p^w) is prime.
- a(n) is the smallest prime factor of 1 + lcm(1..k) where k is the n-th prime power A000961(n).A051454
a(n) is the smallest prime factor of 1 + lcm(1..k) where k is the n-th prime power A000961(n).
- (Terms in A029623)/2.A051455
(Terms in A029623)/2.
- (Terms in A029625)/2.A051456
(Terms in A029625)/2.
- (Terms in A029627)/2.A051457
(Terms in A029627)/2.
- (Terms in A029631)/2.A051458
(Terms in A029631)/2.
- Number of orderings of the subsets of a set with n elements that are compatible with the subsets' sizes; i.e., if A, B are two subsets with A <= B then Card(A) <= Card(B).A051459
Number of orderings of the subsets of a set with n elements that are compatible with the subsets' sizes; i.e., if A, B are two subsets with A <= B then Card(A) <= Card(B).
- Number of asymmetric types of Boolean functions of n variables under action of symmetric group.A051460
Number of asymmetric types of Boolean functions of n variables under action of symmetric group.