Sequences
392,541 sequences
- Number of compositions (ordered partitions) of n that are concave-down sequences.A070211
Number of compositions (ordered partitions) of n that are concave-down sequences.
- Number of 5 X 5 pandiagonal magic squares with sum n.A070212
Number of 5 X 5 pandiagonal magic squares with sum n.
- Numbers k such that A056542(k) is prime.A070213
Numbers k such that A056542(k) is prime.
- Maximal number of occupied cells in all monotonic matrices of order n.A070214
Maximal number of occupied cells in all monotonic matrices of order n.
- Number of ways to write the n-th prime as a sum of distinct primes.A070215
Number of ways to write the n-th prime as a sum of distinct primes.
- Triangle T(n, k) = n^2 + k^2, 1 <= k <= n, read by rows.A070216
Triangle T(n, k) = n^2 + k^2, 1 <= k <= n, read by rows.
- Numbers not represented by a known atomic weight as given in Francis W. Aston's Nobel lecture in 1922.A070217
Numbers not represented by a known atomic weight as given in Francis W. Aston's Nobel lecture in 1922.
- a(1) = 2; a(n) is the smallest prime greater than the sum of all previous terms.A070218
a(1) = 2; a(n) is the smallest prime greater than the sum of all previous terms.
- Smallest prime obtained as a concatenation of n and a number m greater than n.A070219
Smallest prime obtained as a concatenation of n and a number m greater than n.
- Primes of the form n (written in base 10) followed by n 1's.A070220
Primes of the form n (written in base 10) followed by n 1's.
- a(n)=LPF(n+1)-LPF(n), where LPF(n) denotes the largest prime factor of n.A070221
a(n)=LPF(n+1)-LPF(n), where LPF(n) denotes the largest prime factor of n.
- Numbers k such that the sum of prime divisors of k divides the sum of divisors of k.A070222
Numbers k such that the sum of prime divisors of k divides the sum of divisors of k.
- Square roots of A069191, sorted.A070223
Square roots of A069191, sorted.
- Numbers k such that the sum of p^2, where p are the prime divisors of k, divides the sum of d^2, where d are the divisors of k.A070224
Numbers k such that the sum of p^2, where p are the prime divisors of k, divides the sum of d^2, where d are the divisors of k.
- Numbers k such that (sigma(k)-k) - Sum_{p|k} p^2 = -1.A070225
Numbers k such that (sigma(k)-k) - Sum_{p|k} p^2 = -1.
- Numbers n such that the squarefree kernel of n is equal to the number of divisors of n.A070226
Numbers n such that the squarefree kernel of n is equal to the number of divisors of n.
- a(n) = Sum_{k>=0} (k+n)!^n/((k+n)!*(k!^n)*exp(1)).A070227
a(n) = Sum_{k>=0} (k+n)!^n/((k+n)!*(k!^n)*exp(1)).
- Number of perfect powers (A001597) not exceeding 2^n.A070228
Number of perfect powers (A001597) not exceeding 2^n.
- Next m>n such that m is divisible by lpf(n), lpf=A006530 largest prime factor.A070229
Next m>n such that m is divisible by lpf(n), lpf=A006530 largest prime factor.
- Let S_n ={p_n + q : p_n is the n-th odd prime and q runs through odd primes not greater than p_n}; sequence gives size of S_n intersect S_(n+1).A070230
Let S_n ={p_n + q : p_n is the n-th odd prime and q runs through odd primes not greater than p_n}; sequence gives size of S_n intersect S_(n+1).
- Let u(k), v(k), w(k) satisfy the recursions u(1) = v(1) = w(1) = 1, u(k+1) = u(k) + v(k) + w(k), v(k+1) = u(k)*v(k) + v(k)*w(k) + w(k)*u(k), and w(k+1) = u(k)*v(k)*w(k) for k >= 1; then a(n) = u(n).A070231
Let u(k), v(k), w(k) satisfy the recursions u(1) = v(1) = w(1) = 1, u(k+1) = u(k) + v(k) + w(k), v(k+1) = u(k)*v(k) + v(k)*w(k) + w(k)*u(k), and w(k+1) = u(k)*v(k)*w(k) for k >= 1; then a(n) = u(n).
- a(1) = 4; a(n) = smallest composite number greater than the sum of all previous terms.A070232
a(1) = 4; a(n) = smallest composite number greater than the sum of all previous terms.
- Let u(k), v(k), w(k) satisfy the recursions u(1) = v(1) = w(1) = 1, u(k+1) = u(k) + v(k) + w(k), v(k+1) = u(k)*v(k) + v(k)*w(k) + w(k)*u(k), and w(k+1) = u(k)*v(k)*w(k) for k >= 1; then a(n) = w(n).A070233
Let u(k), v(k), w(k) satisfy the recursions u(1) = v(1) = w(1) = 1, u(k+1) = u(k) + v(k) + w(k), v(k+1) = u(k)*v(k) + v(k)*w(k) + w(k)*u(k), and w(k+1) = u(k)*v(k)*w(k) for k >= 1; then a(n) = w(n).
- Let u(k), v(k), w(k) satisfy the recursions u(1) = v(1) = w(1) = 1, u(k+1) = u(k) + v(k) + w(k), v(k+1) = u(k)*v(k) + v(k)*w(k) + w(k)*u(k), and w(k+1) = u(k)*v(k)*w(k); then a(n) = v(n).A070234
Let u(k), v(k), w(k) satisfy the recursions u(1) = v(1) = w(1) = 1, u(k+1) = u(k) + v(k) + w(k), v(k+1) = u(k)*v(k) + v(k)*w(k) + w(k)*u(k), and w(k+1) = u(k)*v(k)*w(k); then a(n) = v(n).
- Number of partitions of 3^n into distinct terms.A070235
Number of partitions of 3^n into distinct terms.
- a(n) = Sum_{k=1..n} (core(k) - phi(k)), where core(k) is the squarefree part of k.A070236
a(n) = Sum_{k=1..n} (core(k) - phi(k)), where core(k) is the squarefree part of k.
- Numbers k such that the sign of core(k)-phi(k) is not equal to 2*mu(k)^2-1, where core(k) is the squarefree part of k.A070237
Numbers k such that the sign of core(k)-phi(k) is not equal to 2*mu(k)^2-1, where core(k) is the squarefree part of k.
- Sign of core(n)-phi(n) where core(n) is the squarefree part of n and phi the Euler totient function.A070238
Sign of core(n)-phi(n) where core(n) is the squarefree part of n and phi the Euler totient function.
- a(1) = 1; a(2) = 2; a(n) = sigma_a[n-2] (a[n-1]), n > 2, where sigma_k (n) denotes the sum of the k-th powers of the divisors of n.A070239
a(1) = 1; a(2) = 2; a(n) = sigma_a[n-2] (a[n-1]), n > 2, where sigma_k (n) denotes the sum of the k-th powers of the divisors of n.
- Duplicate of A007369.A070240
Duplicate of A007369.
- Erroneous version of A066412.A070241
Erroneous version of A066412.
- a(n) = Card( k>0 : sigma(k)=sigma(n) ).A070242
a(n) = Card( k>0 : sigma(k)=sigma(n) ).
- a(n) = Card{ k, phi(k) <= n }.A070243
a(n) = Card{ k, phi(k) <= n }.
- Largest palindrome using minimum number of digits with a digit sum = n.A070244
Largest palindrome using minimum number of digits with a digit sum = n.
- Smallest palindromic prime with digit sum = n, or 0 if no such prime exists.A070245
Smallest palindromic prime with digit sum = n, or 0 if no such prime exists.
- a(n) = lcm(n, R(n)) / gcd(n, R(n)), where R(n) (A004086) is the digit reversal of n.A070246
a(n) = lcm(n, R(n)) / gcd(n, R(n)), where R(n) (A004086) is the digit reversal of n.
- Palindromic primes with digit sum 5.A070247
Palindromic primes with digit sum 5.
- Palindromic primes with digit sum 7.A070248
Palindromic primes with digit sum 7.
- Palindromic primes with digit sum 8.A070249
Palindromic primes with digit sum 8.
- Palindromic primes with digit sum 10.A070250
Palindromic primes with digit sum 10.
- Unrelated-factorial numbers: product of numbers unrelated to n (numbers which have a common divisor with n but do not divide n).A070251
Unrelated-factorial numbers: product of numbers unrelated to n (numbers which have a common divisor with n but do not divide n).
- Number of n-digit palindromes.A070252
Number of n-digit palindromes.
- Numbers k such that k^2 - 1 is a palindrome.A070253
Numbers k such that k^2 - 1 is a palindrome.
- Perfect squares one more than a palindrome.A070254
Perfect squares one more than a palindrome.
- Numbers which divided into two substrings by breaking at any digit then one of them divides the other (0 is not to be considered a substring, multiples of 10 are excluded).A070255
Numbers which divided into two substrings by breaking at any digit then one of them divides the other (0 is not to be considered a substring, multiples of 10 are excluded).
- Define P(n,X) by the recursion P(1,X) = 1, P(n+1,X) = (P(n,X)+X)^2; then a(1) = 0 and for n > 1 a(n) is the coefficient of X^(2^(n-2)) in P(n,X) of degree 2^(n-1).A070256
Define P(n,X) by the recursion P(1,X) = 1, P(n+1,X) = (P(n,X)+X)^2; then a(1) = 0 and for n > 1 a(n) is the coefficient of X^(2^(n-2)) in P(n,X) of degree 2^(n-1).
- Fecundity of n sets a new record.A070257
Fecundity of n sets a new record.
- Smallest of 3 consecutive numbers each divisible by a square.A070258
Smallest of 3 consecutive numbers each divisible by a square.
- Array f(m,n) read by antidiagonals: f(m,n) = minimal number of 0's in a 2m X 2n (0,1) matrix that contains no m X n submatrix of 1's (m >= 1, n >= 1).A070259
Array f(m,n) read by antidiagonals: f(m,n) = minimal number of 0's in a 2m X 2n (0,1) matrix that contains no m X n submatrix of 1's (m >= 1, n >= 1).
- Third diagonal of triangle defined in A051537.A070260
Third diagonal of triangle defined in A051537.