Sequences
392,541 sequences
- Smallest number whose sum of digits is n^4.A060711
Smallest number whose sum of digits is n^4.
- Smallest number whose sum of digits is 3^n.A060712
Smallest number whose sum of digits is 3^n.
- Smallest number whose sum of digits is 5^n.A060713
Smallest number whose sum of digits is 5^n.
- a(n) = a(n-1) + a(n-1 minus the number of terms of the same parity as n so far).A060714
a(n) = a(n-1) + a(n-1 minus the number of terms of the same parity as n so far).
- Number of primes between n and 2n exclusive.A060715
Number of primes between n and 2n exclusive.
- Singular n X n matrices over GF(4).A060716
Singular n X n matrices over GF(4).
- Degrees of irreducible representations of alternating group A_14.A060717
Degrees of irreducible representations of alternating group A_14.
- Duplicate of A060743.A060718
Duplicate of A060743.
- a(0) = 1; a(n+1) = a(n) + Sum_{i=0..n} binomial(n,i)*(a(i)+1).A060719
a(0) = 1; a(n+1) = a(n) + Sum_{i=0..n} binomial(n,i)*(a(i)+1).
- Singular n X n matrices over GF(5).A060720
Singular n X n matrices over GF(5).
- Singular n X n matrices over GF(7).A060721
Singular n X n matrices over GF(7).
- a(n) = 3^(n^2).A060722
a(n) = 3^(n^2).
- a(n) is the denominator of r(n) where r(n) is the sequence of rational numbers defined by the recursion: r(0) = 0, r(1) = 1 and for n>1 r(n) = r(n-1) + r(n-2)/2. From this definition it is clear that a(n) is always a power of 2 (see A060755).A060723
a(n) is the denominator of r(n) where r(n) is the sequence of rational numbers defined by the recursion: r(0) = 0, r(1) = 1 and for n>1 r(n) = r(n-1) + r(n-2)/2. From this definition it is clear that a(n) is always a power of 2 (see A060755).
- Number of subgroups of the group C_n X C_n (where C_n is the cyclic group of order n).A060724
Number of subgroups of the group C_n X C_n (where C_n is the cyclic group of order n).
- E.g.f.: exp(-(x^5/5))/(1-x).A060725
E.g.f.: exp(-(x^5/5))/(1-x).
- For n >= 1, a(n) is the number of permutations in the symmetric group S_n such that their cycle decomposition contains no 6-cycle.A060726
For n >= 1, a(n) is the number of permutations in the symmetric group S_n such that their cycle decomposition contains no 6-cycle.
- For n >= 1 a(n) is the number of permutations in the symmetric group S_n such that their cycle decomposition contains no 7-cycle.A060727
For n >= 1 a(n) is the number of permutations in the symmetric group S_n such that their cycle decomposition contains no 7-cycle.
- Numbers k such that Ramanujan's equation x^2 + 7 = 2^k has an integer solution.A060728
Numbers k such that Ramanujan's equation x^2 + 7 = 2^k has an integer solution.
- a(n+1) = a(n) + a(n minus the number of terms of the same parity as n so far).A060729
a(n+1) = a(n) + a(n minus the number of terms of the same parity as n so far).
- a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == n (mod 3) so far).A060730
a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == n (mod 3) so far).
- a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 4) so far).A060731
a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 4) so far).
- a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 5) so far).A060732
a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 5) so far).
- a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 6) so far).A060733
a(n) = a(n-1) + a(n - 1 minus the number of terms of a(k) == (mod 6) so far).
- Natural numbers written as a square array ending in last row from left to right and rightmost column from bottom to top are read by antidiagonals downwards.A060734
Natural numbers written as a square array ending in last row from left to right and rightmost column from bottom to top are read by antidiagonals downwards.
- a(1)=1, a(2)=2; thereafter, a(n) is the smallest number m not yet in the sequence such that every prime that divides a(n-1) also divides m.A060735
a(1)=1, a(2)=2; thereafter, a(n) is the smallest number m not yet in the sequence such that every prime that divides a(n-1) also divides m.
- Array of square numbers read by antidiagonals in up direction.A060736
Array of square numbers read by antidiagonals in up direction.
- Number of distinct differences between consecutive divisors of n! (ordered by size).A060737
Number of distinct differences between consecutive divisors of n! (ordered by size).
- Number of distinct differences between consecutive divisors (ordered by increasing magnitude) of n! which are not also divisors of n!.A060738
Number of distinct differences between consecutive divisors (ordered by increasing magnitude) of n! which are not also divisors of n!.
- a(n) = (-1)^(n(n-1)/2) * Product_{k=0,...,n-1} (n+k-1)!/((k!)^2 * (n-1-k)!).A060739
a(n) = (-1)^(n(n-1)/2) * Product_{k=0,...,n-1} (n+k-1)!/((k!)^2 * (n-1-k)!).
- Erroneous version of A003002.A060740
Erroneous version of A003002.
- Number of divisors of 2n which are also differences between consecutive divisors of 2n (ordered by size).A060741
Number of divisors of 2n which are also differences between consecutive divisors of 2n (ordered by size).
- Number of divisors of n! which are also differences between consecutive divisors of n! (ordered by size).A060742
Number of divisors of n! which are also differences between consecutive divisors of n! (ordered by size).
- Least k such that gcd( p(k), q(k) ) is n, where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009).A060743
Least k such that gcd( p(k), q(k) ) is n, where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009).
- Numbers n such that n | p(n)*q(n), where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009).A060744
Numbers n such that n | p(n)*q(n), where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009).
- When gcd( p(n), q(n) ) increases, where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009).A060745
When gcd( p(n), q(n) ) increases, where p() is the unrestricted partition function (A000041) and q is the distinct partition function (A000009).
- Absolute value of numerator of non-Euler-constant term of Laurent expansion of Gamma function at s = -n.A060746
Absolute value of numerator of non-Euler-constant term of Laurent expansion of Gamma function at s = -n.
- a(n) = 2*n - 1.A060747
a(n) = 2*n - 1.
- a(n) is the smallest m such that the elliptic curve x^3 + y^3 = m has rank n, or -1 if no such m exists.A060748
a(n) is the smallest m such that the elliptic curve x^3 + y^3 = m has rank n, or -1 if no such m exists.
- Triangle in which n-th row lists all primitive roots modulo the n-th prime.A060749
Triangle in which n-th row lists all primitive roots modulo the n-th prime.
- Step at which card n appears on top of deck for first time in Guy's shuffling problem A035485.A060750
Step at which card n appears on top of deck for first time in Guy's shuffling problem A035485.
- These numbers take a record number of steps to reach the top of the deck in Guy's shuffle (see A060750).A060751
These numbers take a record number of steps to reach the top of the deck in Guy's shuffle (see A060750).
- These numbers are the record number of steps for the numbers in A060751 to reach the top of the deck in Guy's shuffle (see A060750).A060752
These numbers are the record number of steps for the numbers in A060751 to reach the top of the deck in Guy's shuffle (see A060750).
- Denominator of 1*2*4*6*...*(prime(n-1)-1) / (2*3*5*7*...*prime(n-1)).A060753
Denominator of 1*2*4*6*...*(prime(n-1)-1) / (2*3*5*7*...*prime(n-1)).
- Absolute values of a certain cubic form at integer points (see Formula).A060754
Absolute values of a certain cubic form at integer points (see Formula).
- a(n) = log_2(A060723(n)).A060755
a(n) = log_2(A060723(n)).
- a(n) is the smallest number for which exactly n primes are bounded between a(n) and 2a(n) exclusively.A060756
a(n) is the smallest number for which exactly n primes are bounded between a(n) and 2a(n) exclusively.
- a(n) = 4^(n^2).A060757
a(n) = 4^(n^2).
- a(n) = 5^(n^2).A060758
a(n) = 5^(n^2).
- a(n) = 7^(n^2).A060759
a(n) = 7^(n^2).
- a(n) = 8^(n^2).A060760
a(n) = 8^(n^2).