Sequences
392,541 sequences
- Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2), with initial terms 407389224418, 76343678551.A082411
Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2), with initial terms 407389224418, 76343678551.
- a(n) = (2*8^n + 2^n)/3.A082412
a(n) = (2*8^n + 2^n)/3.
- a(n) = (2*9^n + 3^n)/3.A082413
a(n) = (2*9^n + 3^n)/3.
- a(n) = (2*10^n + 4^n)/3.A082414
a(n) = (2*10^n + 4^n)/3.
- Numbers k such that in all partitions of k into distinct coprimes these coprimes are also mutually relatively prime.A082415
Numbers k such that in all partitions of k into distinct coprimes these coprimes are also mutually relatively prime.
- Parity of A073941(n).A082416
Parity of A073941(n).
- Numbers k such that P(k) < P(k+1) > P(k+2), where P(k) is the largest prime factor of k (A006530).A082417
Numbers k such that P(k) < P(k+1) > P(k+2), where P(k) is the largest prime factor of k (A006530).
- Numbers k such that P(k) > P(k+1) < P(k+2), where P(n) = largest prime factor of n (A006530).A082418
Numbers k such that P(k) > P(k+1) < P(k+2), where P(n) = largest prime factor of n (A006530).
- Numbers n such that P(n+2) < P(n) < P(n+1), where P(n) = largest prime factor of n (A006530).A082419
Numbers n such that P(n+2) < P(n) < P(n+1), where P(n) = largest prime factor of n (A006530).
- Numbers n such that P(n) < P(n+2) < P(n+1), where P(n) = largest prime factor of n (A006530).A082420
Numbers n such that P(n) < P(n+2) < P(n+1), where P(n) = largest prime factor of n (A006530).
- Numbers n such that P(n+1) < P(n) < P(n+2), where P(n) = largest prime factor of n (A006530).A082421
Numbers n such that P(n+1) < P(n) < P(n+2), where P(n) = largest prime factor of n (A006530).
- Numbers n such that P(n) > P(n+2) > P(n+1), where P(n) = largest prime factor of n (A006530).A082422
Numbers n such that P(n) > P(n+2) > P(n+1), where P(n) = largest prime factor of n (A006530).
- a(1)=1, a(n)=ceiling(n/(n+1)*sum(k=1,n-1,a(k))).A082423
a(1)=1, a(n)=ceiling(n/(n+1)*sum(k=1,n-1,a(k))).
- Coefficient of s(2n) in s(n,n) * s(n,n) * s(n,n) * s(n,n) * s(n,n) * s(n,n), where s(n,n) is the Schur function indexed by two parts of size n, s(2n) is the Schur function corresponding to the trivial representation and * represents the inner or Kronecker product.A082424
Coefficient of s(2n) in s(n,n) * s(n,n) * s(n,n) * s(n,n) * s(n,n) * s(n,n), where s(n,n) is the Schur function indexed by two parts of size n, s(2n) is the Schur function corresponding to the trivial representation and * represents the inner or Kronecker product.
- a(1)=1, a(n) = -1 + n*Sum_{j=1..n-1} a(j).A082425
a(1)=1, a(n) = -1 + n*Sum_{j=1..n-1} a(j).
- a(n) = floor(n*n!/2 + 1).A082426
a(n) = floor(n*n!/2 + 1).
- a(1)=1, a(n) = n * (Sum_{k=1..n-1} a(k)) - 2.A082427
a(1)=1, a(n) = n * (Sum_{k=1..n-1} a(k)) - 2.
- a(1) = 1; a(n) = 3 + n * Sum_{k=1..n-1} a(k).A082428
a(1) = 1; a(n) = 3 + n * Sum_{k=1..n-1} a(k).
- a(n) is the cardinality of the smallest subset S1 of S={1,2,3,...,n} such that every element of S is either in S1 or is the sum of two distinct elements of S1.A082429
a(n) is the cardinality of the smallest subset S1 of S={1,2,3,...,n} such that every element of S is either in S1 or is the sum of two distinct elements of S1.
- a(1)=1; for n > 1, a(n) = n*(a(n-1) + a(n-2) + ... + a(2) + a(1)) + 4.A082430
a(1)=1; for n > 1, a(n) = n*(a(n-1) + a(n-2) + ... + a(2) + a(1)) + 4.
- a(n) = the smallest prime p such that there are exactly n sets of consecutive primes, each of which has an arithmetic mean of p.A082431
a(n) = the smallest prime p such that there are exactly n sets of consecutive primes, each of which has an arithmetic mean of p.
- a(n) = p - A072181(n), where p is the least prime > A072181(n) + 1.A082432
a(n) = p - A072181(n), where p is the least prime > A072181(n) + 1.
- a(n) = A072181(n) - p, where p is the largest prime < A072181(n) - 1.A082433
a(n) = A072181(n) - p, where p is the largest prime < A072181(n) - 1.
- Let q_n be least prime > x_n := 1 + 2*n!; sequence gives a(n) = q_n-x_n+1.A082434
Let q_n be least prime > x_n := 1 + 2*n!; sequence gives a(n) = q_n-x_n+1.
- Palindromic primes with middle digit 0.A082435
Palindromic primes with middle digit 0.
- Palindromic primes with middle digit 1.A082436
Palindromic primes with middle digit 1.
- Coefficient of s(2n) in s(n,n) * s(n,n) * s(n,n) * s(n,n) * s(n,n), where s(2n) is the Schur function corresponding to the trivial representation, s(n,n) is a Schur function corresponding two the two row partition and * represents the inner or Kronecker product of symmetric functions.A082437
Coefficient of s(2n) in s(n,n) * s(n,n) * s(n,n) * s(n,n) * s(n,n), where s(2n) is the Schur function corresponding to the trivial representation, s(n,n) is a Schur function corresponding two the two row partition and * represents the inner or Kronecker product of symmetric functions.
- Palindromic primes with middle digit 2.A082438
Palindromic primes with middle digit 2.
- Palindromic primes with middle digit 3.A082439
Palindromic primes with middle digit 3.
- Palindromic primes with middle digit 4.A082440
Palindromic primes with middle digit 4.
- Palindromic primes with middle digit 5.A082441
Palindromic primes with middle digit 5.
- Palindromic primes with middle digit 6.A082442
Palindromic primes with middle digit 6.
- Palindromic primes with middle digit 7.A082443
Palindromic primes with middle digit 7.
- Palindromic primes with middle digit 8.A082444
Palindromic primes with middle digit 8.
- Palindromic primes with middle digit 9.A082445
Palindromic primes with middle digit 9.
- a(0)=0, a(1)=1, a(2)=0; thereafter, if k>=0 and a block of the first 3*2^k terms is known, then a(3*2^k+i)=1-a(i) for 0<=i<3*2^k.A082446
a(0)=0, a(1)=1, a(2)=0; thereafter, if k>=0 and a block of the first 3*2^k terms is known, then a(3*2^k+i)=1-a(i) for 0<=i<3*2^k.
- a(n) = the number k such that s(k)=0 where s(0)=n and s(i)=s(i-1)-(s(i-1) modulo (i+1)).A082447
a(n) = the number k such that s(k)=0 where s(0)=n and s(i)=s(i-1)-(s(i-1) modulo (i+1)).
- Add 1, multiply by 1, add 2, multiply by 2, etc.; start with 4.A082448
Add 1, multiply by 1, add 2, multiply by 2, etc.; start with 4.
- Let f(p) = greatest prime divisor of p-1. Sequence gives smallest prime which takes at least n steps to reach 2 when f is iterated.A082449
Let f(p) = greatest prime divisor of p-1. Sequence gives smallest prime which takes at least n steps to reach 2 when f is iterated.
- a(n) = 5*(n^2 - n + 2)/2.A082450
a(n) = 5*(n^2 - n + 2)/2.
- Sum over divisors d of n of Kronecker symbol (-60, d).A082451
Sum over divisors d of n of Kronecker symbol (-60, d).
- a(n)=2n+1 where n is such that A083344(n) is not zero.A082452
a(n)=2n+1 where n is such that A083344(n) is not zero.
- a(n)=2n+1 where n is such that A083344(n) is zero.A082453
a(n)=2n+1 where n is such that A083344(n) is zero.
- a(n) = prime(n) + prime(n-1) - a(n-1) with a(0) = a(1) = 0.A082454
a(n) = prime(n) + prime(n-1) - a(n-1) with a(0) = a(1) = 0.
- a(n) = prime(n) + prime(n-1) - a(n-1), a(0) = 0, a(1) = 4.A082455
a(n) = prime(n) + prime(n-1) - a(n-1), a(0) = 0, a(1) = 4.
- a(n) = prime(n) + prime(n-1) - a(n-1), with a(0)=0, a(1)=127, and prime(i) is the i-th prime.A082456
a(n) = prime(n) + prime(n-1) - a(n-1), with a(0)=0, a(1)=127, and prime(i) is the i-th prime.
- a(n) = gcd(1+2n, A057643(1+2n)).A082457
a(n) = gcd(1+2n, A057643(1+2n)).
- Multiply by 1, add 1, multiply by 2, add 2, etc., starting with 0.A082458
Multiply by 1, add 1, multiply by 2, add 2, etc., starting with 0.
- Multiply by 1, add 1, multiply by 2, add 2, etc.A082459
Multiply by 1, add 1, multiply by 2, add 2, etc.
- a(n) = pi(n) - a(n - 1) where pi(n) = A000720(n).A082460
a(n) = pi(n) - a(n - 1) where pi(n) = A000720(n).