Sequences
392,541 sequences
- Numbers whose square has a majority of one digit.A060811
Numbers whose square has a majority of one digit.
- Numbers whose square has a majority of one digit and does not end in 0.A060812
Numbers whose square has a majority of one digit and does not end in 0.
- Numbers whose square has more than 2/3 of its digits the same.A060813
Numbers whose square has more than 2/3 of its digits the same.
- Numbers whose cubes contain more than half the same digit and do not end in 0.A060814
Numbers whose cubes contain more than half the same digit and do not end in 0.
- Powers of 2 with each digit a power of 2 (only digits 0,1,2,4,8 are used).A060815
Powers of 2 with each digit a power of 2 (only digits 0,1,2,4,8 are used).
- a(0) = 1; a(n) = (5*3^(n-1) - 1)/2 for n > 0.A060816
a(0) = 1; a(n) = (5*3^(n-1) - 1)/2 for n > 0.
- Size of the automorphism group of the alternating group A_n.A060817
Size of the automorphism group of the alternating group A_n.
- a(n) = 2^(n - HammingWeight(n)) = 2^(n - BitCount(n)) = 2^(n - A000120(n)).A060818
a(n) = 2^(n - HammingWeight(n)) = 2^(n - BitCount(n)) = 2^(n - A000120(n)).
- a(n) = n / gcd(n,4).A060819
a(n) = n / gcd(n,4).
- a(n) = (2*n-1)^2 + (2*n)^2.A060820
a(n) = (2*n-1)^2 + (2*n)^2.
- Triangle read by rows. T(n, k) are the coefficients of the Hermite polynomial of order n, for 0 <= k <= n.A060821
Triangle read by rows. T(n, k) are the coefficients of the Hermite polynomial of order n, for 0 <= k <= n.
- a(n) = prime(n) + n^3 + n^2 + 4n - 1.A060822
a(n) = prime(n) + n^3 + n^2 + 4n - 1.
- 4-wave sequence beginning with 2's with middles dropped.A060823
4-wave sequence beginning with 2's with middles dropped.
- 4-wave sequence beginning with 2s.A060824
4-wave sequence beginning with 2s.
- Smallest n-digit left truncatable prime of Henry VIII type.A060825
Smallest n-digit left truncatable prime of Henry VIII type.
- a(n) is the largest number such that 3^a(n) [also 6^a(n)] divides A025487(n) (least prime signatures).A060826
a(n) is the largest number such that 3^a(n) [also 6^a(n)] divides A025487(n) (least prime signatures).
- 3-wave sequence beginning with 2's.A060827
3-wave sequence beginning with 2's.
- Size of the Sylow 3-subgroup of the symmetric group S_n.A060828
Size of the Sylow 3-subgroup of the symmetric group S_n.
- For each y >= 1 there are only finitely many values of x >= 1 such that x-y and x+y are both squares; list all such pairs (x,y) with gcd(x,y) = 1 ordered by values of y; sequence gives x values.A060829
For each y >= 1 there are only finitely many values of x >= 1 such that x-y and x+y are both squares; list all such pairs (x,y) with gcd(x,y) = 1 ordered by values of y; sequence gives x values.
- Erroneous version of A120427.A060830
Erroneous version of A120427.
- a(n) = Sum_{k=1..n} (number of odd divisors of k) (cf. A001227).A060831
a(n) = Sum_{k=1..n} (number of odd divisors of k) (cf. A001227).
- a(n) = Sum_{k>0} floor(n/k!).A060832
a(n) = Sum_{k>0} floor(n/k!).
- Separate the natural numbers into disjoint sets A, B with 1 in A, such that the sum of any 2 distinct elements of the same set never equals 2^k + 2. Sequence gives elements of set A.A060833
Separate the natural numbers into disjoint sets A, B with 1 in A, such that the sum of any 2 distinct elements of the same set never equals 2^k + 2. Sequence gives elements of set A.
- a(n) = 6*n^2 + 6*n + 31.A060834
a(n) = 6*n^2 + 6*n + 31.
- Least number of the form x^2 + y^3 (x, y positive) in n ways.A060835
Least number of the form x^2 + y^3 (x, y positive) in n ways.
- Number of permutations of n letters where exactly 5 change position.A060836
Number of permutations of n letters where exactly 5 change position.
- List the positive rationals in the canonical order A020652(n)/A020653(n) and apply the Sagher map to turn them into integers.A060837
List the positive rationals in the canonical order A020652(n)/A020653(n) and apply the Sagher map to turn them into integers.
- Rank of elliptic curve x^3 + y^3 = n.A060838
Rank of elliptic curve x^3 + y^3 = n.
- Number of solutions to x^3 == 1 (mod n).A060839
Number of solutions to x^3 == 1 (mod n).
- Number of irreducible representations of symmetric group S_n whose degree is not divisible by 3.A060840
Number of irreducible representations of symmetric group S_n whose degree is not divisible by 3.
- Numerator of 1/det(M) where M is the n X n matrix with M[i,j] = 1/lcm(i,j).A060841
Numerator of 1/det(M) where M is the n X n matrix with M[i,j] = 1/lcm(i,j).
- a(n) = (binomial(2*p,p)-2)/p^2 where p = prime(n).A060842
a(n) = (binomial(2*p,p)-2)/p^2 where p = prime(n).
- Busy Beaver problem: a(n) is the maximal number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting.A060843
Busy Beaver problem: a(n) is the maximal number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting.
- Primes of the form 6*k^2 + 6*k + 31.A060844
Primes of the form 6*k^2 + 6*k + 31.
- Largest prime < a nontrivial power of a prime.A060845
Largest prime < a nontrivial power of a prime.
- Smallest prime > the n-th nontrivial power of a prime.A060846
Smallest prime > the n-th nontrivial power of a prime.
- Difference between a nontrivial prime power (A246547) and the previous prime.A060847
Difference between a nontrivial prime power (A246547) and the previous prime.
- Difference between a nontrivial prime power (A025475) and the next prime.A060848
Difference between a nontrivial prime power (A025475) and the next prime.
- Difference between 2 consecutive primes between which a nontrivial power of prime is found.A060849
Difference between 2 consecutive primes between which a nontrivial power of prime is found.
- Array of the coefficients A(n,k) in the expansion of Product_{i>=1} 1/(1-x^i)^n = Sum_{k>=0} A(n,k)*x^k, n >= 1, k >= 0.A060850
Array of the coefficients A(n,k) in the expansion of Product_{i>=1} 1/(1-x^i)^n = Sum_{k>=0} A(n,k)*x^k, n >= 1, k >= 0.
- a(n) = (2n-1) * 3^(2n-1).A060851
a(n) = (2n-1) * 3^(2n-1).
- Sum of number of pips on dice in shape of Platonic solids.A060852
Sum of number of pips on dice in shape of Platonic solids.
- Number of possible games of 10-pin bowling with a total score of n.A060853
Number of possible games of 10-pin bowling with a total score of n.
- Array T(m,n) read by antidiagonals: T(m,n) (m >= 1, n >= 1) = number of ways to arrange the numbers 1,2,...,m*n in an m X n matrix so that each row and each column is increasing.A060854
Array T(m,n) read by antidiagonals: T(m,n) (m >= 1, n >= 1) = number of ways to arrange the numbers 1,2,...,m*n in an m X n matrix so that each row and each column is increasing.
- Multi-dimensional Catalan numbers: diagonal T(n,n+1) of A060854.A060855
Multi-dimensional Catalan numbers: diagonal T(n,n+1) of A060854.
- Multi-dimensional Catalan numbers: diagonal T(n,n+2) of A060854.A060856
Multi-dimensional Catalan numbers: diagonal T(n,n+2) of A060854.
- Describe all the numbers already used (sorted into increasing order - not splitting numbers up into their digits).A060857
Describe all the numbers already used (sorted into increasing order - not splitting numbers up into their digits).
- "0303456", a popular song by Rafaela Carra.A060858
"0303456", a popular song by Rafaela Carra.
- Powerful numbers of the form k^2 - 1.A060859
Powerful numbers of the form k^2 - 1.
- Numbers k such that k^2-1 and k^2 are consecutive powerful numbers.A060860
Numbers k such that k^2-1 and k^2 are consecutive powerful numbers.