Sequences
392,541 sequences
- a(1) = 2, a(n) = k*a(n-1) + 1, where a(n) is the smallest prime of the form k*a(n-1) + 1 and k > 1.A059411
a(1) = 2, a(n) = k*a(n-1) + 1, where a(n) is the smallest prime of the form k*a(n-1) + 1 and k > 1.
- Number of distinct minimal unary DFA's with exactly n states.A059412
Number of distinct minimal unary DFA's with exactly n states.
- Number of distinct languages accepted by unary DFA's with n states.A059413
Number of distinct languages accepted by unary DFA's with n states.
- A finite set arising from study of zeta(17).A059414
A finite set arising from study of zeta(17).
- Numerators of sequence arising from Apery's proof that zeta(3) is irrational.A059415
Numerators of sequence arising from Apery's proof that zeta(3) is irrational.
- Denominators of sequence arising from Apery's proof that zeta(3) is irrational.A059416
Denominators of sequence arising from Apery's proof that zeta(3) is irrational.
- Start with 1; square; add 2; subtract 1; repeat.A059417
Start with 1; square; add 2; subtract 1; repeat.
- Triangle T(n,k) arising from enumeration of permutations with ordered orbits, read by rows (1<=k<=n).A059418
Triangle T(n,k) arising from enumeration of permutations with ordered orbits, read by rows (1<=k<=n).
- Triangle T(n,k) (1 <= k <= n) of tangent numbers, read by rows: T(n,k) = coefficient of x^n/n! in expansion of (tan x)^k/k!.A059419
Triangle T(n,k) (1 <= k <= n) of tangent numbers, read by rows: T(n,k) = coefficient of x^n/n! in expansion of (tan x)^k/k!.
- A diagonal of A059419.A059420
A diagonal of A059419.
- A diagonal of A059419.A059421
A diagonal of A059419.
- Difference between number of even equivalence classes and odd classes of terms in a symmetric determinant of order n.A059422
Difference between number of even equivalence classes and odd classes of terms in a symmetric determinant of order n.
- Number of positive terms in a symmetric determinant of order n.A059423
Number of positive terms in a symmetric determinant of order n.
- Number of negative terms in a symmetric determinant of order n.A059424
Number of negative terms in a symmetric determinant of order n.
- Primes of form n^2 + 19n + 17.A059425
Primes of form n^2 + 19n + 17.
- First differences of A026273.A059426
First differences of A026273.
- Triangle read by rows: T(n,k) is the number of permutations of [n] with k alternating runs (n>=2, k>=1).A059427
Triangle read by rows: T(n,k) is the number of permutations of [n] with k alternating runs (n>=2, k>=1).
- Number of points of rotation in a prime block spiral.A059428
Number of points of rotation in a prime block spiral.
- Cumulative boustrophedon transform of 1, 0, 0, 0, ...A059429
Cumulative boustrophedon transform of 1, 0, 0, 0, ...
- Cumulative boustrophedon transform of 1, 1, 1, 1, ...A059430
Cumulative boustrophedon transform of 1, 1, 1, 1, ...
- Triangle formed when cumulative boustrophedon transform is applied to 1, 0, 0, 0, ..., read by rows from left to right.A059431
Triangle formed when cumulative boustrophedon transform is applied to 1, 0, 0, 0, ..., read by rows from left to right.
- Triangle formed when cumulative boustrophedon transform is applied to 1, 0, 0, 0, ..., read by rows in natural order.A059432
Triangle formed when cumulative boustrophedon transform is applied to 1, 0, 0, 0, ..., read by rows in natural order.
- Triangle formed when the cumulative boustrophedon transform is applied to 1, 1, 1, 1, ..., read by rows from left to right.A059433
Triangle formed when the cumulative boustrophedon transform is applied to 1, 1, 1, 1, ..., read by rows from left to right.
- Triangle formed when cumulative boustrophedon transform is applied to 1, 1, 1, 1, ..., read by rows in natural order.A059434
Triangle formed when cumulative boustrophedon transform is applied to 1, 1, 1, 1, ..., read by rows in natural order.
- Number of lattice paths in plane starting at (0,0) and ending at (n,n) with steps from {(i,j): i+j > 0, i, j >= 0} that never go below the line y = x.A059435
Number of lattice paths in plane starting at (0,0) and ending at (n,n) with steps from {(i,j): i+j > 0, i, j >= 0} that never go below the line y = x.
- Smallest number whose set of divisors contains each digit 0-9 at least n times.A059436
Smallest number whose set of divisors contains each digit 0-9 at least n times.
- Consider the last letter of each of the English words zero, one, two, three, four, five, ... . Write down 0 for a vowel or "y", 1 for a consonant.A059437
Consider the last letter of each of the English words zero, one, two, three, four, five, ... . Write down 0 for a vowel or "y", 1 for a consonant.
- Triangle T(n,k) (1 <= k <= n) read by rows: T(n,k) is the number of permutations of [1..n] with k components.A059438
Triangle T(n,k) (1 <= k <= n) read by rows: T(n,k) is the number of permutations of [1..n] with k components.
- A diagonal of A059438.A059439
A diagonal of A059438.
- A diagonal of A059438.A059440
A diagonal of A059438.
- Triangle T(n,k) (n >= 1, 0 <= k <= n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows.A059441
Triangle T(n,k) (n >= 1, 0 <= k <= n-1) giving number of regular labeled graphs with n nodes and degree k, read by rows.
- Array of Ramsey numbers R(n,k) (n >= 2, k >= 2) read by antidiagonals.A059442
Array of Ramsey numbers R(n,k) (n >= 2, k >= 2) read by antidiagonals.
- Triangle T(n,k) (n >= 2, k = 3..n+floor(n/2)) giving number of bicoverings of an n-set with k blocks.A059443
Triangle T(n,k) (n >= 2, k = 3..n+floor(n/2)) giving number of bicoverings of an n-set with k blocks.
- Decimal expansion of square root of (Pi * e / 2).A059444
Decimal expansion of square root of (Pi * e / 2).
- Continued fraction for square root of (Pi * e / 2).A059445
Continued fraction for square root of (Pi * e / 2).
- Triangle T(n,k) = coefficient of x^n*y^k/(n!*k!) in 1/(1-x-y-x*y), read by rows in order 00, 10, 01, 20, 11, 02, ...A059446
Triangle T(n,k) = coefficient of x^n*y^k/(n!*k!) in 1/(1-x-y-x*y), read by rows in order 00, 10, 01, 20, 11, 02, ...
- Smallest number that takes n steps to get to 1 under the map f(n)=sigma(n)-n, the sum of the proper divisors.A059447
Smallest number that takes n steps to get to 1 under the map f(n)=sigma(n)-n, the sum of the proper divisors.
- The parity of the number of zero digits when n is written in binary.A059448
The parity of the number of zero digits when n is written in binary.
- a(n)! begins with 2^n.A059449
a(n)! begins with 2^n.
- Triangle read by rows: T(n,k) = Sum_{j=0..k-1} T(n,j) + Sum_{j=1..n-k} T(n-j,k), with T(0,0)=1 and T(n,k) = 0 for k > n.A059450
Triangle read by rows: T(n,k) = Sum_{j=0..k-1} T(n,j) + Sum_{j=1..n-k} T(n-j,k), with T(0,0)=1 and T(n,k) = 0 for k > n.
- Number of ways n can be written as the sum of two numbers whose binary expansions have even numbers of zeros; also number of ways n can be written as the sum of two numbers whose binary expansions have odd numbers of zeros.A059451
Number of ways n can be written as the sum of two numbers whose binary expansions have even numbers of zeros; also number of ways n can be written as the sum of two numbers whose binary expansions have odd numbers of zeros.
- Safe primes (A005385) that are not Sophie Germain primes.A059452
Safe primes (A005385) that are not Sophie Germain primes.
- Sophie Germain primes (A005384) that are not safe primes (A005385).A059453
Sophie Germain primes (A005384) that are not safe primes (A005385).
- Numbers k such that 2*3^k - 7 is prime.A059454
Numbers k such that 2*3^k - 7 is prime.
- Safe primes which are also Sophie Germain primes.A059455
Safe primes which are also Sophie Germain primes.
- Unsafe primes: primes not in A005385.A059456
Unsafe primes: primes not in A005385.
- Numerator of Sum_{k=0..n} (-1)^k/(3*k+1).A059457
Numerator of Sum_{k=0..n} (-1)^k/(3*k+1).
- A binary sequence: a(1) = 10 (2 in decimal) and a(n+1) is obtained by trying to complement just one bit of a(n), starting with the least significant bit, until a new prime is reached.A059458
A binary sequence: a(1) = 10 (2 in decimal) and a(n+1) is obtained by trying to complement just one bit of a(n), starting with the least significant bit, until a new prime is reached.
- a(1) = 2; a(n+1) is obtained by writing a(n) in binary and trying to complement just one bit, starting with the least significant bit, until a new prime is reached.A059459
a(1) = 2; a(n+1) is obtained by writing a(n) in binary and trying to complement just one bit, starting with the least significant bit, until a new prime is reached.
- Iteration of unitary-sigma function: a(1) = 2, a(n) = usigma(a(n-1)).A059460
Iteration of unitary-sigma function: a(1) = 2, a(n) = usigma(a(n-1)).