Sequences
392,541 sequences
- Row sums of triangle A084408.A084411
Row sums of triangle A084408.
- Least palindromic prime that strictly encloses the n-th palindromic prime, or 0 if no such prime exists.A084412
Least palindromic prime that strictly encloses the n-th palindromic prime, or 0 if no such prime exists.
- Smallest prime with "n" as central digit(s), or -1 if no such prime exists.A084413
Smallest prime with "n" as central digit(s), or -1 if no such prime exists.
- Duplicate of A069691.A084414
Duplicate of A069691.
- Erroneous version of A076600.A084415
Erroneous version of A076600.
- Triangle read by rows: T(n,k) = Sum_{i=k..n} i!*Stirling2(n,i), n >= 1, 1 <= k <= n.A084416
Triangle read by rows: T(n,k) = Sum_{i=k..n} i!*Stirling2(n,i), n >= 1, 1 <= k <= n.
- Triangle read by rows: T(n,k)=sum((n+1-i)!*stirling2(n,n+1-i),i=1..k), n>=1, 1<=k<=n.A084417
Triangle read by rows: T(n,k)=sum((n+1-i)!*stirling2(n,n+1-i),i=1..k), n>=1, 1<=k<=n.
- Numbers n with property that n sets a new record for number of ways to write n as the sum of a brilliant number and a prime.A084418
Numbers n with property that n sets a new record for number of ways to write n as the sum of a brilliant number and a prime.
- a(n) = number of primes that can be formed by adding 1 to the product of any subset of the divisors of n.A084419
a(n) = number of primes that can be formed by adding 1 to the product of any subset of the divisors of n.
- Least number k such that between k! and (k+1)! there are n powers of ten.A084420
Least number k such that between k! and (k+1)! there are n powers of ten.
- a(n) = A005187(A000040(n)).A084421
a(n) = A005187(A000040(n)).
- Number of subsets of integers 1 through n (including the empty set) containing no pair of integers that share a common factor.A084422
Number of subsets of integers 1 through n (including the empty set) containing no pair of integers that share a common factor.
- Set partitions up to rotations.A084423
Set partitions up to rotations.
- Odd numbers having odd numbers of prime factors, odd sums of prime factors and odd sums of decimal digits.A084424
Odd numbers having odd numbers of prime factors, odd sums of prime factors and odd sums of decimal digits.
- Let b(0) = n, b(2*k+1) = c, where c > b(m) is the smallest number such that gcd(c,b(2*k))=1, b(2*k+2) = e where e < b(m) is the smallest number such that gcd(e,b(2*k+1))=1 for m = 0..2*k, until reaching e = 1. Then a(n) = the last c.A084425
Let b(0) = n, b(2*k+1) = c, where c > b(m) is the smallest number such that gcd(c,b(2*k))=1, b(2*k+2) = e where e < b(m) is the smallest number such that gcd(e,b(2*k+1))=1 for m = 0..2*k, until reaching e = 1. Then a(n) = the last c.
- Twice A082082.A084426
Twice A082082.
- Gregorian calendar years with Ascension Day in April.A084427
Gregorian calendar years with Ascension Day in April.
- Numbers n such that n 7's followed by n is prime.A084428
Numbers n such that n 7's followed by n is prime.
- Integers m such that the base-10 digit concatenation 4//m//3//m//2//m//1 is prime.A084429
Integers m such that the base-10 digit concatenation 4//m//3//m//2//m//1 is prime.
- Smallest prime with "n^3" as central digit(s).A084430
Smallest prime with "n^3" as central digit(s).
- Expansion of g.f. (1 + 6*x + 5*x^2)/((1-2*x)*(1+2*x)).A084431
Expansion of g.f. (1 + 6*x + 5*x^2)/((1-2*x)*(1+2*x)).
- Expansion of 2/(1-x) + Sum_{k>=0} t^2(3-t)/(1+t)/(1-t)^2, where t=x^2^k.A084432
Expansion of 2/(1-x) + Sum_{k>=0} t^2(3-t)/(1+t)/(1-t)^2, where t=x^2^k.
- Numbers whose cyclic permutations have GCD > 1.A084433
Numbers whose cyclic permutations have GCD > 1.
- Numbers whose digit permutations have GCD > 1.A084434
Numbers whose digit permutations have GCD > 1.
- a(1) = 2, then smallest prime of the form 2^k*a(n-1) + 1.A084435
a(1) = 2, then smallest prime of the form 2^k*a(n-1) + 1.
- Smallest prime which is one more than the square of a squarefree number with n prime divisors.A084436
Smallest prime which is one more than the square of a squarefree number with n prime divisors.
- Duplicate of A037083.A084437
Duplicate of A037083.
- Positive integers k such that k!!! - 1 = A007661(k) - 1 is prime.A084438
Positive integers k such that k!!! - 1 = A007661(k) - 1 is prime.
- Number of triangular partitions of n of order 3.A084439
Number of triangular partitions of n of order 3.
- Number of ways to write the n-th prime as 1+p+p^k, p prime and k > 0.A084440
Number of ways to write the n-th prime as 1+p+p^k, p prime and k > 0.
- Primes that can be written as 1+p+p^k, p prime and k > 0.A084441
Primes that can be written as 1+p+p^k, p prime and k > 0.
- Primes that can be written uniquely as 1+p+p^k, p prime and k > 0.A084442
Primes that can be written uniquely as 1+p+p^k, p prime and k > 0.
- Primes that can be written in more than one way as 1+p+p^k, p prime and k>0.A084443
Primes that can be written in more than one way as 1+p+p^k, p prime and k>0.
- Primes that can be written as 1+p+p^k, p prime and k > 1.A084444
Primes that can be written as 1+p+p^k, p prime and k > 1.
- Primes that cannot be written as 1+p+p^k, p prime and k > 0.A084445
Primes that cannot be written as 1+p+p^k, p prime and k > 0.
- Number of triangular partitions of n of order 4.A084446
Number of triangular partitions of n of order 4.
- Number of triangular partitions of n of order 5.A084447
Number of triangular partitions of n of order 5.
- Decimal expansion of (negative of) Kinkelin constant.A084448
Decimal expansion of (negative of) Kinkelin constant.
- Positions of sevens (ground states) in A084451.A084449
Positions of sevens (ground states) in A084451.
- Sequence A084451 in binary.A084450
Sequence A084451 in binary.
- Juggling states associated with the juggling sequence A084452.A084451
Juggling states associated with the juggling sequence A084452.
- An infinite juggling sequence with three balls: a(n) is zero when A084451(n-1) is even, otherwise the least (lowest) throw such that the resulting next juggling state A084451(n) does not occur in A084451[0..n-1].A084452
An infinite juggling sequence with three balls: a(n) is zero when A084451(n-1) is even, otherwise the least (lowest) throw such that the resulting next juggling state A084451(n) does not occur in A084451[0..n-1].
- a(n) = n + A084452(n) - 3.A084453
a(n) = n + A084452(n) - 3.
- Inverse permutation to A084453.A084454
Inverse permutation to A084453.
- Permutation of Z, obtained by reflecting the juggling sequence A084452 from positive to negative numbers (with zero thrown at beat 0), folded to N with functions N2Z and Z2N.A084455
Permutation of Z, obtained by reflecting the juggling sequence A084452 from positive to negative numbers (with zero thrown at beat 0), folded to N with functions N2Z and Z2N.
- Sequence A084457 in binary.A084456
Sequence A084457 in binary.
- Juggling states associated with the juggling sequence A084458.A084457
Juggling states associated with the juggling sequence A084458.
- An infinite juggling sequence using three balls: a(n) is the least (lowest) throw needed to ensure that none of the juggling states A084457[n..n+A006519(n)-1] occurs in A084457[0..n-1].A084458
An infinite juggling sequence using three balls: a(n) is the least (lowest) throw needed to ensure that none of the juggling states A084457[n..n+A006519(n)-1] occurs in A084457[0..n-1].
- a(n) = n + A084458(n) - 3.A084459
a(n) = n + A084458(n) - 3.
- Inverse permutation to A084459.A084460
Inverse permutation to A084459.