Sequences
392,541 sequences
- Prime powers m such that sigma_4(m^2)/sigma_2(m^2) is prime.A066111
Prime powers m such that sigma_4(m^2)/sigma_2(m^2) is prime.
- Numbers k such that sigma_4(k)/sigma_2(k) is an integer but not a prime.A066112
Numbers k such that sigma_4(k)/sigma_2(k) is an integer but not a prime.
- a(n) is the number of conjugacy classes of maximal subgroups of the alternating group A_n.A066113
a(n) is the number of conjugacy classes of maximal subgroups of the alternating group A_n.
- a(0) = 1; for n > 0, a(n) = (n!*(3*n+1))/2.A066114
a(0) = 1; for n > 0, a(n) = (n!*(3*n+1))/2.
- Number of conjugacy classes of maximal subgroups of the symmetric group S_n.A066115
Number of conjugacy classes of maximal subgroups of the symmetric group S_n.
- a(n) = prime(n-2)*prime(n-1)^2*prime(n).A066116
a(n) = prime(n-2)*prime(n-1)^2*prime(n).
- Triangle read by rows: T(n,k) = T(n-1,k-1)*T(n,k-1) and T(n,1) = prime(n).A066117
Triangle read by rows: T(n,k) = T(n-1,k-1)*T(n,k-1) and T(n,1) = prime(n).
- a(n) = n!*(3*n-1)/2.A066118
a(n) = n!*(3*n-1)/2.
- Multi-level primorials: triangle with a(n,k)=a(n-1,k-1)*a(n-1,k) but with a(n,1)=p(n) and a(n,n)=2.A066119
Multi-level primorials: triangle with a(n,k)=a(n-1,k-1)*a(n-1,k) but with a(n,1)=p(n) and a(n,n)=2.
- Superduperprimorials: product of first n terms in Chernoff sequence.A066120
Superduperprimorials: product of first n terms in Chernoff sequence.
- Multi-level factorials: triangle with a(n,k)=a(n-1,k-1)*a(n-1,k) but with a(n,1)=n and a(n,n)=1.A066121
Multi-level factorials: triangle with a(n,k)=a(n-1,k-1)*a(n-1,k) but with a(n,1)=n and a(n,n)=1.
- Numbers that in base 2 need one 'Reverse and Add' step to reach a palindrome.A066122
Numbers that in base 2 need one 'Reverse and Add' step to reach a palindrome.
- Numbers that in base 2 need two 'Reverse and Add' steps to reach a palindrome.A066123
Numbers that in base 2 need two 'Reverse and Add' steps to reach a palindrome.
- Numbers that in base 2 need three 'Reverse and Add' steps to reach a palindrome.A066124
Numbers that in base 2 need three 'Reverse and Add' steps to reach a palindrome.
- Numbers that in base 2 need four 'Reverse and Add' steps to reach a palindrome.A066125
Numbers that in base 2 need four 'Reverse and Add' steps to reach a palindrome.
- Numbers that in base 2 need five 'Reverse and Add' steps to reach a palindrome.A066126
Numbers that in base 2 need five 'Reverse and Add' steps to reach a palindrome.
- Numbers that in base 2 need six 'Reverse and Add' steps to reach a palindrome.A066127
Numbers that in base 2 need six 'Reverse and Add' steps to reach a palindrome.
- Numbers that in base 2 need seven 'Reverse and Add' steps to reach a palindrome.A066128
Numbers that in base 2 need seven 'Reverse and Add' steps to reach a palindrome.
- Numbers that in base 2 need eight 'Reverse and Add' steps to reach a palindrome.A066129
Numbers that in base 2 need eight 'Reverse and Add' steps to reach a palindrome.
- Numbers that in base 2 need nine 'Reverse and Add' steps to reach a palindrome.A066130
Numbers that in base 2 need nine 'Reverse and Add' steps to reach a palindrome.
- Numbers that in base 2 need ten 'Reverse and Add' steps to reach a palindrome.A066131
Numbers that in base 2 need ten 'Reverse and Add' steps to reach a palindrome.
- Numbers that in base 2 need eleven 'Reverse and Add' steps to reach a palindrome.A066132
Numbers that in base 2 need eleven 'Reverse and Add' steps to reach a palindrome.
- Numbers that in base 2 need twelve 'Reverse and Add' steps to reach a palindrome.A066133
Numbers that in base 2 need twelve 'Reverse and Add' steps to reach a palindrome.
- Numbers from A066112 that are neither square nor twice a square, i.e., are not in A028982 but are in A028983.A066134
Numbers from A066112 that are neither square nor twice a square, i.e., are not in A028982 but are in A028983.
- a(n) = least number m > 1 such that sigma_n(m) = k*m for some k.A066135
a(n) = least number m > 1 such that sigma_n(m) = k*m for some k.
- Primes are replaced by their local sequence number in A000040, while composites are replaced by their sequence number in A002808; (a kind of eigen- or home-indexing).A066136
Primes are replaced by their local sequence number in A000040, while composites are replaced by their sequence number in A002808; (a kind of eigen- or home-indexing).
- Covering numbers C(n,9,8).A066137
Covering numbers C(n,9,8).
- a(n) = 10^(2*n) + 10^n + 1.A066138
a(n) = 10^(2*n) + 10^n + 1.
- Squares in every base >=3 (involving no carries and no digit apart from 0, 1 and 2).A066139
Squares in every base >=3 (involving no carries and no digit apart from 0, 1 and 2).
- Covering numbers C(n,n-3,n-4).A066140
Covering numbers C(n,n-3,n-4).
- a(n) = n^(n-1) + n + 1.A066141
a(n) = n^(n-1) + n + 1.
- a(n) = (n!)^2 + n! + 1.A066142
a(n) = (n!)^2 + n! + 1.
- a(n) = n! + n^2 + n.A066143
a(n) = n! + n^2 + n.
- In base 2: n sets a new record for the number of 'Reverse and Add' steps needed to reach a palindrome starting with n.A066144
In base 2: n sets a new record for the number of 'Reverse and Add' steps needed to reach a palindrome starting with n.
- In base 2, records for the number of 'Reverse and Add' steps needed to reach a palindrome.A066145
In base 2, records for the number of 'Reverse and Add' steps needed to reach a palindrome.
- Primes associated with A066042.A066146
Primes associated with A066042.
- Numbers k such that all 3 of EulerPhi(k) + 1, d(k) + 1, sigma(k) + 1 are simultaneously prime (d(k) denotes the number of divisors of k).A066147
Numbers k such that all 3 of EulerPhi(k) + 1, d(k) + 1, sigma(k) + 1 are simultaneously prime (d(k) denotes the number of divisors of k).
- Primes with an even number of 0's in binary expansion.A066148
Primes with an even number of 0's in binary expansion.
- Primes with an odd number of 0's in binary expansion.A066149
Primes with an odd number of 0's in binary expansion.
- Maximal number of divisors of any n-digit number.A066150
Maximal number of divisors of any n-digit number.
- Smallest n-digit number with A066150(n) divisors.A066151
Smallest n-digit number with A066150(n) divisors.
- Numbers k such that phi(k) = sigma(k+1) - sigma(k).A066152
Numbers k such that phi(k) = sigma(k+1) - sigma(k).
- (product of digits of n) * (sum of digits of n) = 4n.A066153
(product of digits of n) * (sum of digits of n) = 4n.
- Numbers k such that phi(k) = sigma(k) - sigma(k-1).A066154
Numbers k such that phi(k) = sigma(k) - sigma(k-1).
- Numbers k such that phi(k) = sigma(k+1) - sigma(k-1).A066155
Numbers k such that phi(k) = sigma(k+1) - sigma(k-1).
- a(n) is the least k>n such that k*n = (product of digits of k) * (sum of digits of k), or 0 if no such k exists.A066156
a(n) is the least k>n such that k*n = (product of digits of k) * (sum of digits of k), or 0 if no such k exists.
- Numbers whose reciprocals have patterns of b repeating digits in their expansion in base b; leading non-repetitive digits are ignored.A066157
Numbers whose reciprocals have patterns of b repeating digits in their expansion in base b; leading non-repetitive digits are ignored.
- Number of fixed polyominoes with n cells and tree-like structure.A066158
Number of fixed polyominoes with n cells and tree-like structure.
- Numbers k such that 4k-1 divides (2k-1)! + 1.A066159
Numbers k such that 4k-1 divides (2k-1)! + 1.
- Numbers k such that 4k-1 divides (2k-1)! - 1.A066160
Numbers k such that 4k-1 divides (2k-1)! - 1.