Sequences
392,541 sequences
- Decimal expansion of the number c = Sum_{n>=1} (zeta(n+1)-1)/n.A085361
Decimal expansion of the number c = Sum_{n>=1} (zeta(n+1)-1)/n.
- a(0)=1; for n>0, a(n) = 2*5^(n-1) - (1/2)*Sum_{i=1..n-1} a(i)*a(n-i).A085362
a(0)=1; for n>0, a(n) = 2*5^(n-1) - (1/2)*Sum_{i=1..n-1} a(i)*a(n-i).
- a(0)=1, for n>0: a(n) = 4*9^(n-1) - (1/2)*Sum_{i=1..n-1} a(i)*a(n-i).A085363
a(0)=1, for n>0: a(n) = 4*9^(n-1) - (1/2)*Sum_{i=1..n-1} a(i)*a(n-i).
- a(0)=1, for n>0: a(n) = 6*13^(n-1) - (1/2)*Sum_{i=1..n-1} a(i)*a(n-i).A085364
a(0)=1, for n>0: a(n) = 6*13^(n-1) - (1/2)*Sum_{i=1..n-1} a(i)*a(n-i).
- Decimal expansion of the Kepler-Bouwkamp or polygon-inscribing constant.A085365
Decimal expansion of the Kepler-Bouwkamp or polygon-inscribing constant.
- Semiprimes that are the sum of two positive cubes. Common terms of A003325 and A046315.A085366
Semiprimes that are the sum of two positive cubes. Common terms of A003325 and A046315.
- Semiprimes that can be expressed as the sum or difference of two cubes: intersection of A001358 and A045980.A085367
Semiprimes that can be expressed as the sum or difference of two cubes: intersection of A001358 and A045980.
- Sum of numerators and denominators of convergents to e.A085368
Sum of numerators and denominators of convergents to e.
- Cutting sequence for 1/e.A085369
Cutting sequence for 1/e.
- Niven (or Harshad) numbers that are not divisible by 3.A085370
Niven (or Harshad) numbers that are not divisible by 3.
- Non-Niven (or non-Harshad) numbers that are divisible by 3.A085371
Non-Niven (or non-Harshad) numbers that are divisible by 3.
- If n = 0 or 1 then a(n) = 1; if n = 2, 3 or 4 then a(n) = 0; otherwise a(n) = (n+1)*a(n-1)-(n-2)*a(n-2)-(n-5)*a(n-3)+(n-3)*a(n-4).A085372
If n = 0 or 1 then a(n) = 1; if n = 2, 3 or 4 then a(n) = 0; otherwise a(n) = (n+1)*a(n-1)-(n-2)*a(n-2)-(n-5)*a(n-3)+(n-3)*a(n-4).
- a(n) = binomial(2n+1, n+1)*binomial(n+2, 2).A085373
a(n) = binomial(2n+1, n+1)*binomial(n+2, 2).
- a(n) = binomial(2n+1, n+1)*binomial(n+3, 3).A085374
a(n) = binomial(2n+1, n+1)*binomial(n+3, 3).
- a(n) = binomial(2*n+1, n+1)*binomial(n+4, 4).A085375
a(n) = binomial(2*n+1, n+1)*binomial(n+4, 4).
- Ratio-dependent insertion sequence I(0.36704) (see the link below).A085376
Ratio-dependent insertion sequence I(0.36704) (see the link below).
- a(n) = 15n^2 + 13n^3.A085377
a(n) = 15n^2 + 13n^3.
- Difference between primes p and the largest prime divisor of p-1.A085378
Difference between primes p and the largest prime divisor of p-1.
- Greatest prime as sum of distinct divisors of n.A085379
Greatest prime as sum of distinct divisors of n.
- Numbers k such that (greatest prime as sum of distinct divisors of k) = (greatest prime not greater sum of divisors of k).A085380
Numbers k such that (greatest prime as sum of distinct divisors of k) = (greatest prime not greater sum of divisors of k).
- Numbers k such that (greatest prime as sum of distinct divisors of k) < (greatest prime not greater sum of divisors of k).A085381
Numbers k such that (greatest prime as sum of distinct divisors of k) < (greatest prime not greater sum of divisors of k).
- Sum of p = prime(n) and largest prime divisor of p-1.A085382
Sum of p = prime(n) and largest prime divisor of p-1.
- Triangle read by rows, 1 <= k <= n: T(n,k) = floor(n/k)*ceiling(n/k).A085383
Triangle read by rows, 1 <= k <= n: T(n,k) = floor(n/k)*ceiling(n/k).
- Ramanujan sum c_n(4).A085384
Ramanujan sum c_n(4).
- Binomial transform of hexagonal pyramidal numbers A002412.A085385
Binomial transform of hexagonal pyramidal numbers A002412.
- E.g.f. cosh(x+x^2/2).A085386
E.g.f. cosh(x+x^2/2).
- E.g.f exp(x)*cosh(x+x^2/2).A085387
E.g.f exp(x)*cosh(x+x^2/2).
- First differences of n^k.A085388
First differences of n^k.
- a(1) = 1; for n >= 2, a(n) = (n*(n+1)^(n-1))/(n+1).A085389
a(1) = 1; for n >= 2, a(n) = (n*(n+1)^(n-1))/(n+1).
- a(n) = (n(n+1)^(n-2)+0^(n-2))/(n+1).A085390
a(n) = (n(n+1)^(n-2)+0^(n-2))/(n+1).
- Square array of centered numbers, read by antidiagonals.A085391
Square array of centered numbers, read by antidiagonals.
- a(n) = largest prime divisor of n, or 1 if n is 1 or a prime.A085392
a(n) = largest prime divisor of n, or 1 if n is 1 or a prime.
- Difference between the largest and the smallest prime factor of the greatest proper divisor of n.A085393
Difference between the largest and the smallest prime factor of the greatest proper divisor of n.
- Numerators of convergents to Thue-Morse constant.A085394
Numerators of convergents to Thue-Morse constant.
- Denominators of convergents to the Thue-Morse constant 0.41245403364...A085395
Denominators of convergents to the Thue-Morse constant 0.41245403364...
- Numerator and denominator sums of convergents to the Thue-Morse constant, 0.412454033...A085396
Numerator and denominator sums of convergents to the Thue-Morse constant, 0.412454033...
- Numbers that are not perfect powers and whose squarefree part is not congruent to 1 (mod 4).A085397
Numbers that are not perfect powers and whose squarefree part is not congruent to 1 (mod 4).
- Let Cn(x) be the n-th cyclotomic polynomial; a(n) is the least k>1 such that Cn(k) is prime.A085398
Let Cn(x) be the n-th cyclotomic polynomial; a(n) is the least k>1 such that Cn(k) is prime.
- Let Cn(x) be the n-th cyclotomic polynomial; a(n) is the first prime Cn(x) after Cn(1).A085399
Let Cn(x) be the n-th cyclotomic polynomial; a(n) is the first prime Cn(x) after Cn(1).
- a(n) = abs(A085061(n-1) - A085061(n)).A085400
a(n) = abs(A085061(n-1) - A085061(n)).
- a(0) = 1; a(n+1) is the smallest positive number (of at most two) such that abs(a(n) - a(n+1)) is the smallest prime not occurring earlier as difference of successive terms and a(n) + a(n+1) is composite.A085401
a(0) = 1; a(n+1) is the smallest positive number (of at most two) such that abs(a(n) - a(n+1)) is the smallest prime not occurring earlier as difference of successive terms and a(n) + a(n+1) is composite.
- a(n) = abs(A085401(n-1) - A085401(n)).A085402
a(n) = abs(A085401(n-1) - A085401(n)).
- Expansion of (1-x+sqrt(1-6x+x^2))/2 in powers of x.A085403
Expansion of (1-x+sqrt(1-6x+x^2))/2 in powers of x.
- Number of n X n matrices over GF(4) with rank n-1.A085404
Number of n X n matrices over GF(4) with rank n-1.
- Common residues of binomial(3n+2,n+1)/(3n+2) modulo 2.A085405
Common residues of binomial(3n+2,n+1)/(3n+2) modulo 2.
- Duplicate of A022340.A085406
Duplicate of A022340.
- Runs of zeros in binomial(3k+2,k+1)/(3k+2) modulo 2 (A085405).A085407
Runs of zeros in binomial(3k+2,k+1)/(3k+2) modulo 2 (A085405).
- Total number of cycles in the binary n-cube.A085408
Total number of cycles in the binary n-cube.
- Sum of three solutions of the Diophantine equation x^2 - y^2 = z^3.A085409
Sum of three solutions of the Diophantine equation x^2 - y^2 = z^3.
- Total number of parts in all partitions of n into relatively prime parts.A085410
Total number of parts in all partitions of n into relatively prime parts.