Sequences
392,541 sequences
- a(1) = 1; a(n+1) is the least prime of the form (2^k)*a(n)+-1, for some positive k.A084361
a(1) = 1; a(n+1) is the least prime of the form (2^k)*a(n)+-1, for some positive k.
- a(n) = Sum{j_1 + ... + j_n = n} Sum_{k=1..n} k*C(n-1,k-1), where the outer sum is over all partitions of n.A084362
a(n) = Sum{j_1 + ... + j_n = n} Sum_{k=1..n} k*C(n-1,k-1), where the outer sum is over all partitions of n.
- a(n) = n^(n+1) - (n-1)^n.A084363
a(n) = n^(n+1) - (n-1)^n.
- Define the operations M: multiply by 11, D: divide by 11, R: reverse digits. Sequence gives trajectory of 19 under action of M,R,D,R.A084364
Define the operations M: multiply by 11, D: divide by 11, R: reverse digits. Sequence gives trajectory of 19 under action of M,R,D,R.
- Squarefree kernel of numbers that are not prime powers.A084365
Squarefree kernel of numbers that are not prime powers.
- Numbers n such that the n-th prime number has an odd number of digits and becomes composite if the central digit is removed.A084366
Numbers n such that the n-th prime number has an odd number of digits and becomes composite if the central digit is removed.
- a(n) = n*(2*n+1)^2.A084367
a(n) = n*(2*n+1)^2.
- Numbers k such that prime(k) does not contain the digit 1.A084368
Numbers k such that prime(k) does not contain the digit 1.
- Numbers n such that the n-th prime number doesn't contain any even digits.A084369
Numbers n such that the n-th prime number doesn't contain any even digits.
- Convolution of odd primes with themselves.A084370
Convolution of odd primes with themselves.
- Squarefree kernels of powerful numbers (A001694).A084371
Squarefree kernels of powerful numbers (A001694).
- Least composite k such that the nearest integer to the average of the smallest and largest prime factors of k equals n.A084372
Least composite k such that the nearest integer to the average of the smallest and largest prime factors of k equals n.
- Numbers k such that smallest digit of k = total number of divisors of k.A084373
Numbers k such that smallest digit of k = total number of divisors of k.
- Numbers k such that the smallest digit of k = number of prime divisors of k (counted with multiplicity).A084374
Numbers k such that the smallest digit of k = number of prime divisors of k (counted with multiplicity).
- Indices of primes which remain prime if any one digit is deleted (leading zeros allowed).A084375
Indices of primes which remain prime if any one digit is deleted (leading zeros allowed).
- G.f.: (1+x)/Product_{m>0} (1 - x^m).A084376
G.f.: (1+x)/Product_{m>0} (1 - x^m).
- a(n) = n^3 + 7.A084377
a(n) = n^3 + 7.
- a(n) = n^3 + 3.A084378
a(n) = n^3 + 3.
- a(n) = n^3 + 17.A084379
a(n) = n^3 + 17.
- a(n) = n^3 + 2.A084380
a(n) = n^3 + 2.
- a(n) = n^3 + 5.A084381
a(n) = n^3 + 5.
- a(n) = n^3 + 6.A084382
a(n) = n^3 + 6.
- a(0)=0; for n>0, a(n) = smallest number that is not a concatenation of any number of distinct earlier terms in increasing order.A084383
a(0)=0; for n>0, a(n) = smallest number that is not a concatenation of any number of distinct earlier terms in increasing order.
- a(1) = 2; a(n+1) = smallest k > a(n) that is divisible by at most (1/2)*[tau(k)] previous terms.A084384
a(1) = 2; a(n+1) = smallest k > a(n) that is divisible by at most (1/2)*[tau(k)] previous terms.
- a(1) = 1; a(n+1) is the smallest number not occurring earlier and coprime to Sum_{j=1..n} a(j).A084385
a(1) = 1; a(n+1) is the smallest number not occurring earlier and coprime to Sum_{j=1..n} a(j).
- Number of pairs of rabbits when there are 3 pairs per litter and offspring reach parenthood after 3 gestation periods; a(n) = a(n-1) + 3*a(n-3), with a(0) = a(1) = a(2) = 1.A084386
Number of pairs of rabbits when there are 3 pairs per litter and offspring reach parenthood after 3 gestation periods; a(n) = a(n-1) + 3*a(n-3), with a(0) = a(1) = a(2) = 1.
- Duplicate of A080761.A084387
Duplicate of A080761.
- a(n) = least positive k such that k^2 - A080761(n) is a cube.A084388
a(n) = least positive k such that k^2 - A080761(n) is a cube.
- a(n) = least positive k such that k^3 + A080761(n) is a square.A084389
a(n) = least positive k such that k^3 + A080761(n) is a square.
- a(n) is the smallest positive integer > a(n-1) with exactly n letters when spelled in English.A084390
a(n) is the smallest positive integer > a(n-1) with exactly n letters when spelled in English.
- For n>3, a(n) = smallest number divisible by exactly n-2 previous terms; a(n)=n for n<=3.A084391
For n>3, a(n) = smallest number divisible by exactly n-2 previous terms; a(n)=n for n<=3.
- For k not divisible by 10, let f(k) be the number obtained by moving the last digit of k to the front. Then a(n) is the smallest k > 0, made of nonzero digits, such that for all 1 <= i < n, i+1 divides f^i(k).A084392
For k not divisible by 10, let f(k) be the number obtained by moving the last digit of k to the front. Then a(n) is the smallest k > 0, made of nonzero digits, such that for all 1 <= i < n, i+1 divides f^i(k).
- Rearrangement of natural numbers such that the n-th term is coprime to n and the sum of n terms starting from the n-th term is a multiple of n.A084393
Rearrangement of natural numbers such that the n-th term is coprime to n and the sum of n terms starting from the n-th term is a multiple of n.
- Sum of n terms starting with the n-th term of A084393.A084394
Sum of n terms starting with the n-th term of A084393.
- A084394(n)/n.A084395
A084394(n)/n.
- a(1) = 1; then numbers in increasing order such that the n-th partial concatenation is divisible by n.A084396
a(1) = 1; then numbers in increasing order such that the n-th partial concatenation is divisible by n.
- a(n) = n-th partial concatenation of A084396(n) divided by n.A084397
a(n) = n-th partial concatenation of A084396(n) divided by n.
- Except for a(1) = 1, rearrangement of natural numbers such that a(n) is not equal to n, but the prime signature of a(n) is the same as that of n.A084398
Except for a(1) = 1, rearrangement of natural numbers such that a(n) is not equal to n, but the prime signature of a(n) is the same as that of n.
- Duplicate of A067057.A084399
Duplicate of A067057.
- a(1) = 1; for n>1, a(n) = smallest number that does not divide the product of all previous terms.A084400
a(1) = 1; for n>1, a(n) = smallest number that does not divide the product of all previous terms.
- n-th partial product + 1 is a prime, where a(n)>1 for n>1.A084401
n-th partial product + 1 is a prime, where a(n)>1 for n>1.
- n-th partial product - 1 is a prime, where a(n) > 1.A084402
n-th partial product - 1 is a prime, where a(n) > 1.
- Primes arising in A084402. a(n) = n-th partial product of A084402 - 1.A084403
Primes arising in A084402. a(n) = n-th partial product of A084402 - 1.
- Numbers n such that n#*2^n+1 is prime, where n# = product of primes <= n.A084404
Numbers n such that n#*2^n+1 is prime, where n# = product of primes <= n.
- Primes whose sum of factorials of digits is also prime.A084405
Primes whose sum of factorials of digits is also prime.
- Numbers k such that k#*2^k-1 is prime, where k# = product of primes <= k.A084406
Numbers k such that k#*2^k-1 is prime, where k# = product of primes <= k.
- Number of decimal places to which the n-th convergent of continued fraction expansion of Pi matches with the correct value.A084407
Number of decimal places to which the n-th convergent of continued fraction expansion of Pi matches with the correct value.
- Triangle read by rows: if n is prime, row n contains the n smallest primes not already used; if n is composite, row n contains the n smallest composite numbers not already used. A permutation of the positive integers.A084408
Triangle read by rows: if n is prime, row n contains the n smallest primes not already used; if n is composite, row n contains the n smallest composite numbers not already used. A permutation of the positive integers.
- Main diagonal of triangle A084408.A084409
Main diagonal of triangle A084408.
- First column of triangle A084408.A084410
First column of triangle A084408.