Sequences
392,541 sequences
- Number of vertically indecomposable distributive lattices on n nodes.A072361
Number of vertically indecomposable distributive lattices on n nodes.
- Composite numbers whose sum of aliquot divisors is palindromic.A072362
Composite numbers whose sum of aliquot divisors is palindromic.
- Composite numbers whose sum of divisors is palindromic.A072363
Composite numbers whose sum of divisors is palindromic.
- Decimal expansion of (1/e)^(1/e).A072364
Decimal expansion of (1/e)^(1/e).
- Decimal expansion of (1/3)^(1/3).A072365
Decimal expansion of (1/3)^(1/3).
- Numbers x such that x + reverse of x is a prime.A072366
Numbers x such that x + reverse of x is a prime.
- Squares x such that x + reverse of x is a prime.A072367
Squares x such that x + reverse of x is a prime.
- Minimal total volume of n bricks with integer sides, all sides being different. Lowest value of sum of products of triples p*q*r chosen from [1,3n].A072368
Minimal total volume of n bricks with integer sides, all sides being different. Lowest value of sum of products of triples p*q*r chosen from [1,3n].
- Cubes x such that x + reverse of x is a prime.A072369
Cubes x such that x + reverse of x is a prime.
- Numbers n such that tau(n) = log(n) + 2 * EulerGamma - 1 (rounded off), where tau(n) denotes the number of divisors of n and EulerGamma denotes the Euler-Mascheroni constant (0.5 is rounded to 0).A072370
Numbers n such that tau(n) = log(n) + 2 * EulerGamma - 1 (rounded off), where tau(n) denotes the number of divisors of n and EulerGamma denotes the Euler-Mascheroni constant (0.5 is rounded to 0).
- a(0) = 0, a(1) = 1, a(n+1) = 2*a(n) + (2*n-1)^2*a(n-1).A072371
a(0) = 0, a(1) = 1, a(n+1) = 2*a(n) + (2*n-1)^2*a(n-1).
- a(0) = 1, a(1) = 1, a(n) = 2*a(n-1) + (2*n-1)^2*a(n-2) for n > 1.A072372
a(0) = 1, a(1) = 1, a(n) = 2*a(n-1) + (2*n-1)^2*a(n-2) for n > 1.
- Complexity of doubled cycle (regarding case n = 2 as a graph).A072373
Complexity of doubled cycle (regarding case n = 2 as a graph).
- a(1) = 1; a(n) = 1 + Sum_{i=1..n} Product_{j=i..2*i-1} (n-j).A072374
a(1) = 1; a(n) = 1 + Sum_{i=1..n} Product_{j=i..2*i-1} (n-j).
- Number of cubefree numbers <= n which are nonsquares having exactly one square in their factorization.A072375
Number of cubefree numbers <= n which are nonsquares having exactly one square in their factorization.
- a(n) = a(floor(n/2)) + a(floor(n/4)) + a(floor(n/8)) + ... starting with a(0)=0 and a(1)=1.A072376
a(n) = a(floor(n/2)) + a(floor(n/4)) + a(floor(n/8)) + ... starting with a(0)=0 and a(1)=1.
- Number of pairs of orthogonal Latin squares of order n.A072377
Number of pairs of orthogonal Latin squares of order n.
- Numbers n such that 12*n divides F(12*n), where F(m) is the m-th Fibonacci number.A072378
Numbers n such that 12*n divides F(12*n), where F(m) is the m-th Fibonacci number.
- Sum_{k<=n} (sigma(k)^2), where sigma(k) denotes the sum of the divisors of k A000203.A072379
Sum_{k<=n} (sigma(k)^2), where sigma(k) denotes the sum of the divisors of k A000203.
- Third differences of partition numbers A000041.A072380
Third differences of partition numbers A000041.
- Numbers m such that Fibonacci(m) is a semiprime.A072381
Numbers m such that Fibonacci(m) is a semiprime.
- Primes which can be represented as the sum of a number and its reverse.A072382
Primes which can be represented as the sum of a number and its reverse.
- Primes which can be represented as the sum of a square and its reverse.A072383
Primes which can be represented as the sum of a square and its reverse.
- Primes which can be represented as the sum of a cube and its reverse.A072384
Primes which can be represented as the sum of a cube and its reverse.
- Primes which can be represented as the sum of a prime and its reverse.A072385
Primes which can be represented as the sum of a prime and its reverse.
- Primes which can be represented as the sum of a triangular number and its reverse.A072386
Primes which can be represented as the sum of a triangular number and its reverse.
- Triangular number x such that x + reverse of x is a prime.A072387
Triangular number x such that x + reverse of x is a prime.
- a(0) = 1; for n > 0, a(n) = floor((prime(n+1) + prime(n) + a(n-1))/3).A072388
a(0) = 1; for n > 0, a(n) = floor((prime(n+1) + prime(n) + a(n-1))/3).
- Numbers of the form x*(x+1) * y*(y+1) ("bipronics") with x and y nonnegative integers.A072389
Numbers of the form x*(x+1) * y*(y+1) ("bipronics") with x and y nonnegative integers.
- Sum of two powers of 13.A072390
Sum of two powers of 13.
- D2(n,n) = Sum_{1<=k<=n} (d_n(k^2)), where d_a(k^2)=card{d: d|k and 1<=d<=a} for real a.A072391
D2(n,n) = Sum_{1<=k<=n} (d_n(k^2)), where d_a(k^2)=card{d: d|k and 1<=d<=a} for real a.
- Numbers n such that reverse(n) = phi(n) (mod n).A072392
Numbers n such that reverse(n) = phi(n) (mod n).
- Numbers n such that n - reverse(n) = phi(n).A072393
Numbers n such that n - reverse(n) = phi(n).
- Numbers n such that sigma(n)=reversal(n)-n.A072394
Numbers n such that sigma(n)=reversal(n)-n.
- Numbers k such that reverse(phi(k)) = k.A072395
Numbers k such that reverse(phi(k)) = k.
- Index of smallest Fibonacci number with n prime factors when counted with multiplicity.A072396
Index of smallest Fibonacci number with n prime factors when counted with multiplicity.
- Smallest Fibonacci number with n prime factors when counted with multiplicity.A072397
Smallest Fibonacci number with n prime factors when counted with multiplicity.
- Numerator of best approximation to Pi with denominator <= 10^n.A072398
Numerator of best approximation to Pi with denominator <= 10^n.
- Denominator of best approximation to Pi with denominator <= 10^n.A072399
Denominator of best approximation to Pi with denominator <= 10^n.
- (Factors of 4 removed from n) modulo 8.A072400
(Factors of 4 removed from n) modulo 8.
- 1 iff n is of the form 4^m*(8k+7).A072401
1 iff n is of the form 4^m*(8k+7).
- a(n) = 6^n * Sum_{k>=1} Gamma(n + k/6)/ (k! * Gamma(k/6) * e).A072402
a(n) = 6^n * Sum_{k>=1} Gamma(n + k/6)/ (k! * Gamma(k/6) * e).
- Numerator of the Reingold-Tarjan sequence, denominator=A072404.A072403
Numerator of the Reingold-Tarjan sequence, denominator=A072404.
- Denominator of the Reingold-Tarjan sequence, numerator=A072403.A072404
Denominator of the Reingold-Tarjan sequence, numerator=A072403.
- Triangle T(n, k) = C(n,k) - C(n-2,k-1) for n >= 3 and T(n, k) = 1 otherwise, read by rows.A072405
Triangle T(n, k) = C(n,k) - C(n-2,k-1) for n >= 3 and T(n, k) = 1 otherwise, read by rows.
- Number of values of k for which C(n,k)-C(n-2,k-1) is odd.A072406
Number of values of k for which C(n,k)-C(n-2,k-1) is odd.
- Canonically 2-indecomposable posets with n antichains.A072407
Canonically 2-indecomposable posets with n antichains.
- Least number > 1 which equals n-th power of the sum of its digits in decimal base.A072408
Least number > 1 which equals n-th power of the sum of its digits in decimal base.
- 4th-order digital invariants: the sum of the 4th power of the digits of n equals some number k and the sum of the 4th power of the digits of k equals n.A072409
4th-order digital invariants: the sum of the 4th power of the digits of n equals some number k and the sum of the 4th power of the digits of k equals n.
- Number of iterations of the map k -> A000001(k) needed to reach 1 starting at n, or -1 if no such number exists.A072410
Number of iterations of the map k -> A000001(k) needed to reach 1 starting at n, or -1 if no such number exists.