Sequences
392,541 sequences
- a(1)=1; a(n) = A059333(a(n-1)) + a(n-1).A059361
a(1)=1; a(n) = A059333(a(n-1)) + a(n-1).
- Primes p such that x^24 = 2 has no solution mod p.A059362
Primes p such that x^24 = 2 has no solution mod p.
- Lexicographically earliest increasing sequence of positive integers such that A001222(a(i)+a(j)) = A001222(a(i)) + A001222(a(j)) for all 1<=i<j.A059363
Lexicographically earliest increasing sequence of positive integers such that A001222(a(i)+a(j)) = A001222(a(i)) + A001222(a(j)) for all 1<=i<j.
- Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.A059364
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.
- Another version of the Catalan triangle: T(r,s) = binomial(2*r-s-1,r-1) - binomial(2*r-s-1,r), r>=0, 0 <= s <= r.A059365
Another version of the Catalan triangle: T(r,s) = binomial(2*r-s-1,r-1) - binomial(2*r-s-1,r), r>=0, 0 <= s <= r.
- Triangle T(m,s), m >= 0, 0 <= s <= m, arising in the computation of certain integrals.A059366
Triangle T(m,s), m >= 0, 0 <= s <= m, arising in the computation of certain integrals.
- From solution to x = tan x (next term is not an integer).A059367
From solution to x = tan x (next term is not an integer).
- Triangle arising from solution to a*x = tan x (next row contains non-integral entries).A059368
Triangle arising from solution to a*x = tan x (next row contains non-integral entries).
- Triangle of numbers T(n,k) = T(n-1,k-1) + ((n+k-1)/k)*T(n-1,k), n >= 1, 1 <= k <= n, with T(n,1) = n!, T(n,n) = 1; read from right to left.A059369
Triangle of numbers T(n,k) = T(n-1,k-1) + ((n+k-1)/k)*T(n-1,k), n >= 1, 1 <= k <= n, with T(n,1) = n!, T(n,n) = 1; read from right to left.
- Triangle of numbers obtained by inverting infinite matrix defined in A059369, read from right to left.A059370
Triangle of numbers obtained by inverting infinite matrix defined in A059369, read from right to left.
- a(n) = (n-1)! + ((n+1)/2)*a(n-1), a(1)=0.A059371
a(n) = (n-1)! + ((n+1)/2)*a(n-1), a(1)=0.
- Revert transform of factorials n! (n >= 1).A059372
Revert transform of factorials n! (n >= 1).
- Second diagonal of triangle in A059370.A059373
Second diagonal of triangle in A059370.
- Triangle read by rows, T(n, k) = Sum_{i=0..n} L'(n, n-i) * binomial(i, k), for k = 0..n-1.A059374
Triangle read by rows, T(n, k) = Sum_{i=0..n} L'(n, n-i) * binomial(i, k), for k = 0..n-1.
- Number of seating arrangements for the ménage problem.A059375
Number of seating arrangements for the ménage problem.
- Jordan function J_3(n).A059376
Jordan function J_3(n).
- Jordan function J_4(n).A059377
Jordan function J_4(n).
- Jordan function J_5(n).A059378
Jordan function J_5(n).
- Array of values of Jordan function J_k(n) read by antidiagonals (version 1).A059379
Array of values of Jordan function J_k(n) read by antidiagonals (version 1).
- Array of values of Jordan function J_k(n) read by antidiagonals (version 2).A059380
Array of values of Jordan function J_k(n) read by antidiagonals (version 2).
- Product J_2(i), i=1..n.A059381
Product J_2(i), i=1..n.
- Product J_3(i), i=1..n.A059382
Product J_3(i), i=1..n.
- a(n) = Product J_4(i), i=1..n.A059383
a(n) = Product J_4(i), i=1..n.
- a(n) = Product_{i=1..n} J_5(i).A059384
a(n) = Product_{i=1..n} J_5(i).
- Expansion of e.g.f. sinh(cosh(x)-1), (even terms only).A059385
Expansion of e.g.f. sinh(cosh(x)-1), (even terms only).
- Expansion of e.g.f. cosh(cosh(x)-1) (even powers only).A059386
Expansion of e.g.f. cosh(cosh(x)-1) (even powers only).
- Jordan function J_n(6) (see A059379).A059387
Jordan function J_n(6) (see A059379).
- Duplicate of A059392.A059388
Duplicate of A059392.
- Sums of two nonzero Fibonacci numbers.A059389
Sums of two nonzero Fibonacci numbers.
- Numbers that are not the sum of two nonzero Fibonacci numbers.A059390
Numbers that are not the sum of two nonzero Fibonacci numbers.
- a(1)=4; a(n) is the smallest number m > a(n-1) such that Omega(m + a(i)) = Omega(m) - Omega(a(i)) for i = 1..(n-1) where Omega(k) is the number of prime divisors of k counted with multiplicity.A059391
a(1)=4; a(n) is the smallest number m > a(n-1) such that Omega(m + a(i)) = Omega(m) - Omega(a(i)) for i = 1..(n-1) where Omega(k) is the number of prime divisors of k counted with multiplicity.
- a(1)=1; a(n) is a k(n)-almost prime; m is an A-almost prime (for 1<=A); a(n) = smallest number m>a(n-1) such that a(i)+m is an (abs[ A-k(i) ])-almost prime for i = 1,2,3,..,n-1.A059392
a(1)=1; a(n) is a k(n)-almost prime; m is an A-almost prime (for 1<=A); a(n) = smallest number m>a(n-1) such that a(i)+m is an (abs[ A-k(i) ])-almost prime for i = 1,2,3,..,n-1.
- Smallest possible sum of n positive integers g(1) < g(2) < ... < g(n) such that A001222(g(i)+g(j)) = A001222(g(i)) + A001222(g(j)) for all 1<=i<j<=n.A059393
Smallest possible sum of n positive integers g(1) < g(2) < ... < g(n) such that A001222(g(i)+g(j)) = A001222(g(i)) + A001222(g(j)) for all 1<=i<j<=n.
- Special safe primes (from A005385) such that the next prime is also a safe prime.A059394
Special safe primes (from A005385) such that the next prime is also a safe prime.
- Smaller of safe prime twins: special safe primes (A005385) p such that the next prime is also the next safe prime and is p+12, i.e., occurs at the closest possible distance, 12.A059395
Smaller of safe prime twins: special safe primes (A005385) p such that the next prime is also the next safe prime and is p+12, i.e., occurs at the closest possible distance, 12.
- Number of primes less than square root of n-th prime; i.e., number of trial divisions by smaller primes to show that n-th prime is indeed prime.A059396
Number of primes less than square root of n-th prime; i.e., number of trial divisions by smaller primes to show that n-th prime is indeed prime.
- Triangle formed by right-bounded rhombus rule, read by rows.A059397
Triangle formed by right-bounded rhombus rule, read by rows.
- Row sums of triangle in A059397.A059398
Row sums of triangle in A059397.
- Triangular hopscotch.A059399
Triangular hopscotch.
- a(n) is the least odd number of the form p + k^2 with p prime and k > 0 which can be represented in exactly n different ways.A059400
a(n) is the least odd number of the form p + k^2 with p prime and k > 0 which can be represented in exactly n different ways.
- Numbers that contain as proper substrings every maximal prime power dividing them.A059401
Numbers that contain as proper substrings every maximal prime power dividing them.
- Numbers with more than one prime factor that do not end in 0 and contain as substrings every maximal prime power dividing them.A059402
Numbers with more than one prime factor that do not end in 0 and contain as substrings every maximal prime power dividing them.
- Quarter-squared applied twice.A059403
Quarter-squared applied twice.
- Numbers with different exponents in their prime factorizations.A059404
Numbers with different exponents in their prime factorizations.
- Numbers that are the product of their digits raised to positive integer powers.A059405
Numbers that are the product of their digits raised to positive integer powers.
- a(n) = a(n-1)*(3a(n-1) + 1)/2 with a(1) = 1.A059406
a(n) = a(n-1)*(3a(n-1) + 1)/2 with a(1) = 1.
- a(n+1) = a(n)-th composite number, with a(1) = 11.A059407
a(n+1) = a(n)-th composite number, with a(1) = 11.
- a(n+1) = a(n)-th composite and a(1) = 13.A059408
a(n+1) = a(n)-th composite and a(1) = 13.
- a(n) = 4^n * (2^n - 1).A059409
a(n) = 4^n * (2^n - 1).
- J_n(9) (see A059379).A059410
J_n(9) (see A059379).