Sequences
392,541 sequences
- a(n) = p-1 if n=p, p if n=p^e and e<>1, 1 otherwise; p a prime.A072211
a(n) = p-1 if n=p, p if n=p^e and e<>1, 1 otherwise; p a prime.
- Smallest m such that number of partitions of m exceeds 10^n.A072212
Smallest m such that number of partitions of m exceeds 10^n.
- Number of partitions of n^2.A072213
Number of partitions of n^2.
- Number of partitions of Fibonacci(n).A072214
Number of partitions of Fibonacci(n).
- a(0) = 4; for n >= 0, a(n+1) = number of partitions of a(n).A072215
a(0) = 4; for n >= 0, a(n+1) = number of partitions of a(n).
- Consider the Reverse and Add! problem (cf. A001127); of all the n-digit numbers N which eventually reach a palindrome, pick that number N which takes the greatest number of steps to converge (in case of a tie, pick the smallest N); sequence gives values of N.A072216
Consider the Reverse and Add! problem (cf. A001127); of all the n-digit numbers N which eventually reach a palindrome, pick that number N which takes the greatest number of steps to converge (in case of a tie, pick the smallest N); sequence gives values of N.
- Consider the Reverse and Add! problem (cf. A001127); of all the n-digit numbers N which eventually reach a palindrome, pick that number N which takes the greatest number of steps to converge (in case of a tie, pick the smallest N); sequence gives number of steps N takes to converge.A072217
Consider the Reverse and Add! problem (cf. A001127); of all the n-digit numbers N which eventually reach a palindrome, pick that number N which takes the greatest number of steps to converge (in case of a tie, pick the smallest N); sequence gives number of steps N takes to converge.
- Consider the Reverse and Add! problem (cf. A001127); of all the n-digit numbers N which eventually reach a palindrome, pick that number N which takes the greatest number of steps to converge (in case of a tie, pick the smallest N); sequence gives palindrome that is reached.A072218
Consider the Reverse and Add! problem (cf. A001127); of all the n-digit numbers N which eventually reach a palindrome, pick that number N which takes the greatest number of steps to converge (in case of a tie, pick the smallest N); sequence gives palindrome that is reached.
- Any number n can be written uniquely in the form n = 2^k_1 - 2^k_2 + 2^k_3 - ... + 2^k_{2r+1} where the signs alternate, there are an odd number of terms, and k_1 > k_2 > k_3 > ... > k_{2r+1} >= 0; sequence gives number of terms 2r+1.A072219
Any number n can be written uniquely in the form n = 2^k_1 - 2^k_2 + 2^k_3 - ... + 2^k_{2r+1} where the signs alternate, there are an odd number of terms, and k_1 > k_2 > k_3 > ... > k_{2r+1} >= 0; sequence gives number of terms 2r+1.
- a(n)-th factorial is the smallest factorial containing exactly n 9's, or 0 if no such number exists.A072220
a(n)-th factorial is the smallest factorial containing exactly n 9's, or 0 if no such number exists.
- a(n) = 6*a(n-1) - a(n-2) + 2, with a(0)=1, a(1)=4.A072221
a(n) = 6*a(n-1) - a(n-2) + 2, with a(0)=1, a(1)=4.
- a(n) = (abs(n-1-a(n-2)) mod n) + (abs(n-1-a(n-1)) mod (n-1)), a(0) = 1, a(1) = 1.A072222
a(n) = (abs(n-1-a(n-2)) mod n) + (abs(n-1-a(n-1)) mod (n-1)), a(0) = 1, a(1) = 1.
- Decimal expansion of unimodal analog of golden section with respect to A072176: a=lim A072176(n)/A072176(n+1).A072223
Decimal expansion of unimodal analog of golden section with respect to A072176: a=lim A072176(n)/A072176(n+1).
- Continued fraction expansion of constant A072223.A072224
Continued fraction expansion of constant A072223.
- Numbers k such that prime(k) + prime(k+1) + prime(k+2) is prime.A072225
Numbers k such that prime(k) + prime(k+1) + prime(k+2) is prime.
- Numbers k such that the k-th cyclotomic polynomial evaluated at 2 (=A019320(k)) is prime.A072226
Numbers k such that the k-th cyclotomic polynomial evaluated at 2 (=A019320(k)) is prime.
- Numbers n such that reverse(d) divides reverse(n) for all divisors d of n.A072227
Numbers n such that reverse(d) divides reverse(n) for all divisors d of n.
- Numbers k such that k equals the sum of the reverses of the proper divisors of k.A072228
Numbers k such that k equals the sum of the reverses of the proper divisors of k.
- Witt index of the standard bilinear form <1,1,1,...,1> over the 2-adic rationals.A072229
Witt index of the standard bilinear form <1,1,1,...,1> over the 2-adic rationals.
- a(n) = n! (mod n^2), that is, n factorial modulo n^2.A072230
a(n) = n! (mod n^2), that is, n factorial modulo n^2.
- a(n) = floor(n^2/A005185(n-1)), where A005185 is Hofstadter's Q-sequence.A072231
a(n) = floor(n^2/A005185(n-1)), where A005185 is Hofstadter's Q-sequence.
- Smallest factorial containing exactly n 9's.A072232
Smallest factorial containing exactly n 9's.
- Square array T(n,k) read by antidiagonals giving number of ways to distribute n indistinguishable objects in k indistinguishable containers; containers may be left empty.A072233
Square array T(n,k) read by antidiagonals giving number of ways to distribute n indistinguishable objects in k indistinguishable containers; containers may be left empty.
- Numbers k such that reverse(k) = sum of the proper divisors of k.A072234
Numbers k such that reverse(k) = sum of the proper divisors of k.
- Years of recorded observations of Comet Halley.A072235
Years of recorded observations of Comet Halley.
- Numbers of primes between successive primorials.A072236
Numbers of primes between successive primorials.
- Smallest factorial containing exactly n 8's.A072237
Smallest factorial containing exactly n 8's.
- Smallest factorial containing exactly n 7's.A072238
Smallest factorial containing exactly n 7's.
- a(0) = 11; a(n) = number of distinct partitions of the previous term.A072239
a(0) = 11; a(n) = number of distinct partitions of the previous term.
- Smallest factorial containing exactly n 6's.A072240
Smallest factorial containing exactly n 6's.
- Number of distinct partitions of Fibonacci(n).A072241
Number of distinct partitions of Fibonacci(n).
- Smallest factorial containing exactly n 5's.A072242
Smallest factorial containing exactly n 5's.
- Number of distinct partitions of n^2.A072243
Number of distinct partitions of n^2.
- Smallest factorial containing exactly n 4's.A072244
Smallest factorial containing exactly n 4's.
- Smallest m such that number of distinct partitions of m exceeds 10^n.A072245
Smallest m such that number of distinct partitions of m exceeds 10^n.
- Numbers which are simultaneously the number of partitions of some k and the number of distinct partitions of some m.A072246
Numbers which are simultaneously the number of partitions of some k and the number of distinct partitions of some m.
- Triangle T(n,k) (n >= 2, 2 <= k <= n-1 if n > 2) giving number of non-crossing trees with n nodes and k endpoints.A072247
Triangle T(n,k) (n >= 2, 2 <= k <= n-1 if n > 2) giving number of non-crossing trees with n nodes and k endpoints.
- Triangle T(n,k) (n >= 2, 1 <= k <= n-1) giving number of non-crossing trees with n nodes and height k.A072248
Triangle T(n,k) (n >= 2, 1 <= k <= n-1) giving number of non-crossing trees with n nodes and height k.
- Related to lollipop graphs.A072249
Related to lollipop graphs.
- Related to cyclotomic numbers of hypergraphs.A072250
Related to cyclotomic numbers of hypergraphs.
- (3*a(n)+1)/2^(2*n + 1) = 23-6*n.A072251
(3*a(n)+1)/2^(2*n + 1) = 23-6*n.
- Numbers n for which one step of the Collatz iteration (3n+1)/2^r gives rise to values 41,35,29,23,17,11, and 5 for r=1,3,5,..,13.A072252
Numbers n for which one step of the Collatz iteration (3n+1)/2^r gives rise to values 41,35,29,23,17,11, and 5 for r=1,3,5,..,13.
- Numbers n for which one step of the Collatz iteration (3n+1)/2^r gives rise to values 59,53,47,41,35,29,23,17,11 and 5 for r=1,3,5,..,19.A072253
Numbers n for which one step of the Collatz iteration (3n+1)/2^r gives rise to values 59,53,47,41,35,29,23,17,11 and 5 for r=1,3,5,..,19.
- Numbers n such that triples generated by {2*(n-1),2*n,2*(n+1)} form A007534.A072254
Numbers n such that triples generated by {2*(n-1),2*n,2*(n+1)} form A007534.
- Number of ways to partition {1,2,...,n} into arithmetic progressions, where in each partition all the progressions have the same common difference and have lengths >= 2.A072255
Number of ways to partition {1,2,...,n} into arithmetic progressions, where in each partition all the progressions have the same common difference and have lengths >= 2.
- a(n) = 10*a(n-1) - a(n-2) for n > 1, a(0) = a(1) = 1.A072256
a(n) = 10*a(n-1) - a(n-2) for n > 1, a(0) = a(1) = 1.
- a(n) = ((6*n-17)*4^n - 1)/3.A072257
a(n) = ((6*n-17)*4^n - 1)/3.
- a(n) = ((6*n+1)*4^n - 1)/3.A072258
a(n) = ((6*n+1)*4^n - 1)/3.
- a(n) = ((6*n+37)*4^n - 1)/3.A072259
a(n) = ((6*n+37)*4^n - 1)/3.
- a(n) = ((6*n+19)*4^n - 1)/3.A072260
a(n) = ((6*n+19)*4^n - 1)/3.