Sequences
392,541 sequences
- 4th diagonal of triangle defined in A051537.A070261
4th diagonal of triangle defined in A051537.
- 5th diagonal of triangle defined in A051537.A070262
5th diagonal of triangle defined in A051537.
- Triangle T(n,k), n >= 0, 1 <= k <= 2^n, read by rows, giving minimal distance-sum of any set of k binary vectors of length n.A070263
Triangle T(n,k), n >= 0, 1 <= k <= 2^n, read by rows, giving minimal distance-sum of any set of k binary vectors of length n.
- Inverse permutation to that in A026098.A070264
Inverse permutation to that in A026098.
- Odd powers: numbers n = m^e with e > 1 odd.A070265
Odd powers: numbers n = m^e with e > 1 odd.
- Maximum element in the simple continued fraction expansion of H(n) = 1+1/2+1/3+...+1/n, the n-th harmonic number.A070266
Maximum element in the simple continued fraction expansion of H(n) = 1+1/2+1/3+...+1/n, the n-th harmonic number.
- Maximum element in the simple continued fraction expansion of e(n) = 1+1/2!+1/3!+...+1/n!.A070267
Maximum element in the simple continued fraction expansion of e(n) = 1+1/2!+1/3!+...+1/n!.
- Numbers k such that mu(k) + mu(k+1) + mu(k+2) = -3.A070268
Numbers k such that mu(k) + mu(k+1) + mu(k+2) = -3.
- Primes for which the smallest positive primitive root is odd and nonprime.A070269
Primes for which the smallest positive primitive root is odd and nonprime.
- Primes for which the smallest positive primitive root is even and nonprime.A070270
Primes for which the smallest positive primitive root is even and nonprime.
- a(n) = n^reverse(n) (ignore leading 0's).A070271
a(n) = n^reverse(n) (ignore leading 0's).
- Numbers n such that reverse(n) = phi(n) + sigma(n).A070272
Numbers n such that reverse(n) = phi(n) + sigma(n).
- Number of letters in the English names of the planets (in order from smallest orbit to largest) in 2002.A070273
Number of letters in the English names of the planets (in order from smallest orbit to largest) in 2002.
- Numbers n such that sum of digits of n equals the squarefree part of n.A070274
Numbers n such that sum of digits of n equals the squarefree part of n.
- Numbers k such that the sum of the digits of k equals the sum of the prime divisors of k.A070275
Numbers k such that the sum of the digits of k equals the sum of the prime divisors of k.
- Numbers n such that sum of digits of n equals the sum of digits of n^3.A070276
Numbers n such that sum of digits of n equals the sum of digits of n^3.
- Smallest prime ending in n, or 0 if no such prime exists.A070277
Smallest prime ending in n, or 0 if no such prime exists.
- Smallest prime > 2n+1 beginning and ending with 2n+1, or 0 if no such prime exists.A070278
Smallest prime > 2n+1 beginning and ending with 2n+1, or 0 if no such prime exists.
- Sum of digits of n equals the sum of digits of 2n.A070279
Sum of digits of n equals the sum of digits of 2n.
- a(1) = 1; a(n) = a(n-1) + product of the digits of n-1.A070280
a(1) = 1; a(n) = a(n-1) + product of the digits of n-1.
- Smallest prime which is the sum of n consecutive primes, or 0 if no such prime exists.A070281
Smallest prime which is the sum of n consecutive primes, or 0 if no such prime exists.
- a(1) = 1; a(2) = 2; a(n) = [sum of digits of a(n-1)]^[sum of digits of a(n-2)] for n > 2.A070282
a(1) = 1; a(2) = 2; a(n) = [sum of digits of a(n-1)]^[sum of digits of a(n-2)] for n > 2.
- a(1) = 1; a(2) = 2; a(n) = [product of digits of a(n-1)]^[product of digits of a(n-2)] for n > 2.A070283
a(1) = 1; a(2) = 2; a(n) = [product of digits of a(n-1)]^[product of digits of a(n-2)] for n > 2.
- Smallest of 4 consecutive numbers each divisible by a square.A070284
Smallest of 4 consecutive numbers each divisible by a square.
- a(n) = n^(n-2) * (n-1)^(n-1).A070285
a(n) = n^(n-2) * (n-1)^(n-1).
- Numbers k such that the equation sigma(sigma(x)) = k has solutions.A070286
Numbers k such that the equation sigma(sigma(x)) = k has solutions.
- Numbers n such that the equation lcm(sigma(x),phi(x))=n has solutions.A070287
Numbers n such that the equation lcm(sigma(x),phi(x))=n has solutions.
- a(n) = Sum_{d|n} omega(d)*omega(n/d).A070288
a(n) = Sum_{d|n} omega(d)*omega(n/d).
- Number of distinct values of multinomial coefficients ( n / (p1, p2, p3, ...) ) where (p1, p2, p3, ...) runs over all partitions of n.A070289
Number of distinct values of multinomial coefficients ( n / (p1, p2, p3, ...) ) where (p1, p2, p3, ...) runs over all partitions of n.
- a(n) = lcm(8,n)/gcd(8,n).A070290
a(n) = lcm(8,n)/gcd(8,n).
- a(n) = lcm(10,n)/gcd(10,n).A070291
a(n) = lcm(10,n)/gcd(10,n).
- a(n) = lcm(12,n)/gcd(12,n).A070292
a(n) = lcm(12,n)/gcd(12,n).
- a(n) = lcm(30,n)/gcd(30,n).A070293
a(n) = lcm(30,n)/gcd(30,n).
- Smallest k such that k==i (mod(i!+1)) i=1,2,3,...,n.A070294
Smallest k such that k==i (mod(i!+1)) i=1,2,3,...,n.
- Smallest composite number such that there are exactly n primes less than it (and coprime to it) which do not divide it, or 0 if no such number exists.A070295
Smallest composite number such that there are exactly n primes less than it (and coprime to it) which do not divide it, or 0 if no such number exists.
- Let sphi(k) = number of primes less than k and coprime to it (A048865); then a(n) = number of integers m with sphi(m) = n.A070296
Let sphi(k) = number of primes less than k and coprime to it (A048865); then a(n) = number of integers m with sphi(m) = n.
- Smallest number with n unrelated numbers (numbers which are neither coprime nor a divisor), or 0 if no such number exists.A070297
Smallest number with n unrelated numbers (numbers which are neither coprime nor a divisor), or 0 if no such number exists.
- Let Unrel(m) = number of unrelated numbers less than m; then a(n) = number of values of m for which Unrel(m) = n.A070298
Let Unrel(m) = number of unrelated numbers less than m; then a(n) = number of values of m for which Unrel(m) = n.
- Numbers n such that sigma(n+x) = sigma(n-x) for some 0 < x < n.A070299
Numbers n such that sigma(n+x) = sigma(n-x) for some 0 < x < n.
- Minimal number of 0's in a 2n X 2n (0,1) matrix that contains no n X n submatrix of 1's.A070300
Minimal number of 0's in a 2n X 2n (0,1) matrix that contains no n X n submatrix of 1's.
- Numbers n such that sum of first 2n primes is prime.A070301
Numbers n such that sum of first 2n primes is prime.
- Number of 3 X 3 X 3 magic cubes with sum 3n.A070302
Number of 3 X 3 X 3 magic cubes with sum 3n.
- Primes p such that the equation p^2*x^2==0 (mod p^2+x^2) has no solution.A070303
Primes p such that the equation p^2*x^2==0 (mod p^2+x^2) has no solution.
- a(n) = number of times n^2*k^2/(n^2+k^2) is an integer as k ranges over 0, 1, 2, ...A070304
a(n) = number of times n^2*k^2/(n^2+k^2) is an integer as k ranges over 0, 1, 2, ...
- Numbers m such that Card(k>0 : phi(k)=phi(m)) = tau(m).A070305
Numbers m such that Card(k>0 : phi(k)=phi(m)) = tau(m).
- a(n) = 2*phi(n)/2^omega(n).A070306
a(n) = 2*phi(n)/2^omega(n).
- Number of n X n matrices with nonnegative integer entries such that every row sum equals 3.A070307
Number of n X n matrices with nonnegative integer entries such that every row sum equals 3.
- "Canada perfect numbers": n such that the sum of digits^2 of n equals the sum of d|n, 1<d<n.A070308
"Canada perfect numbers": n such that the sum of digits^2 of n equals the sum of d|n, 1<d<n.
- Number of solutions 2<=x<=A060679(n) to the equation x^A060679(n)==1 (mod A060679(n)) where A060679(n) are the orders of non-cyclic groups.A070309
Number of solutions 2<=x<=A060679(n) to the equation x^A060679(n)==1 (mod A060679(n)) where A060679(n) are the orders of non-cyclic groups.
- Numbers n such that the sum of its aliquot parts and the number of its divisors are both perfect numbers.A070310
Numbers n such that the sum of its aliquot parts and the number of its divisors are both perfect numbers.