Sequences
392,541 sequences
- Let g_n be the ball packing n-width for the manifold torus X interval; sequence gives numerator of (g_n/Pi)^2.A059811
Let g_n be the ball packing n-width for the manifold torus X interval; sequence gives numerator of (g_n/Pi)^2.
- Let g_n be the ball packing n-width for the manifold torus X interval; sequence gives denominator of (g_n/Pi)^2.A059812
Let g_n be the ball packing n-width for the manifold torus X interval; sequence gives denominator of (g_n/Pi)^2.
- Let s_n be the simplex packing n-width for the manifold torus X interval; sequence gives numerator of s_n/Pi.A059813
Let s_n be the simplex packing n-width for the manifold torus X interval; sequence gives numerator of s_n/Pi.
- Let s_n be the simplex packing n-width for the manifold torus X interval; sequence gives denominator of s_n/Pi.A059814
Let s_n be the simplex packing n-width for the manifold torus X interval; sequence gives denominator of s_n/Pi.
- Let g_n be the ball packing n-width for the manifold torus X square; sequence gives numerator of (g_n/Pi)^2.A059815
Let g_n be the ball packing n-width for the manifold torus X square; sequence gives numerator of (g_n/Pi)^2.
- Let g_n be the ball packing n-width for the manifold torus X square; sequence gives denominator of (g_n/Pi)^2.A059816
Let g_n be the ball packing n-width for the manifold torus X square; sequence gives denominator of (g_n/Pi)^2.
- Let s_n be the simplex packing n-width for the manifold torus X square; sequence gives numerator of s_n/Pi.A059817
Let s_n be the simplex packing n-width for the manifold torus X square; sequence gives numerator of s_n/Pi.
- Let s_n be the simplex packing n-width for the manifold torus X square; sequence gives denominator of s_n/Pi.A059818
Let s_n be the simplex packing n-width for the manifold torus X square; sequence gives denominator of s_n/Pi.
- Expansion of series related to Liouville's Last Theorem: g.f. Sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^2 *Product_{i=1..t} (1-x^i) ).A059819
Expansion of series related to Liouville's Last Theorem: g.f. Sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^2 *Product_{i=1..t} (1-x^i) ).
- Expansion of series related to Liouville's Last Theorem: g.f. Sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^3 *Product_{i=1..t} (1-x^i) ).A059820
Expansion of series related to Liouville's Last Theorem: g.f. Sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^3 *Product_{i=1..t} (1-x^i) ).
- Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^4 *product_{i=1..t} (1-x^i) ).A059821
Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^4 *product_{i=1..t} (1-x^i) ).
- Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^5 *product_{i=1..t} (1-x^i) ).A059822
Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^5 *product_{i=1..t} (1-x^i) ).
- Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^6 *product_{i=1..t} (1-x^i) ).A059823
Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^6 *product_{i=1..t} (1-x^i) ).
- Expansion of series related to Liouville's Last Theorem: g.f. Sum_{t>=1} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^7 * Product_{i=1..t} (1-x^i) ).A059824
Expansion of series related to Liouville's Last Theorem: g.f. Sum_{t>=1} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^7 * Product_{i=1..t} (1-x^i) ).
- Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^8 *product_{i=1..t} (1-x^i) ).A059825
Expansion of series related to Liouville's Last Theorem: g.f. sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^8 *product_{i=1..t} (1-x^i) ).
- a(n) = (n^2 - n + 1)*(n^2 + n + 1).A059826
a(n) = (n^2 - n + 1)*(n^2 + n + 1).
- Cubes of triangular numbers: (n*(n+1)/2)^3.A059827
Cubes of triangular numbers: (n*(n+1)/2)^3.
- Numbers which contain exactly the same digits (with the correct multiplicity) in 3 different smaller bases.A059828
Numbers which contain exactly the same digits (with the correct multiplicity) in 3 different smaller bases.
- Maximal size of a minimal-generating-set of G where G is a finite group of order n.A059829
Maximal size of a minimal-generating-set of G where G is a finite group of order n.
- a(n) = n^6 + n^4 + n^2 + 1.A059830
a(n) = n^6 + n^4 + n^2 + 1.
- Determinant of Wilkinson's eigenvalue test matrix of order 2n+1.A059831
Determinant of Wilkinson's eigenvalue test matrix of order 2n+1.
- A ternary tribonacci triangle: form the triangle as follows: start with 3 single values: 1, 2, 3. Each succeeding row is a concatenation of the previous 3 rows.A059832
A ternary tribonacci triangle: form the triangle as follows: start with 3 single values: 1, 2, 3. Each succeeding row is a concatenation of the previous 3 rows.
- "Madonna's Sequence": add 1 (mod 10) to each digit of Pi.A059833
"Madonna's Sequence": add 1 (mod 10) to each digit of Pi.
- Sum of squares of entries of Wilkinson's eigenvalue test matrix of order 2n+1.A059834
Sum of squares of entries of Wilkinson's eigenvalue test matrix of order 2n+1.
- Form triangle as follows: start with three single digits: 0, 1, 2. Each succeeding row is a concatenation of the previous three rows.A059835
Form triangle as follows: start with three single digits: 0, 1, 2. Each succeeding row is a concatenation of the previous three rows.
- Triangle T(s,t), s >= 1, 1 <= t <= s (see formula line).A059836
Triangle T(s,t), s >= 1, 1 <= t <= s (see formula line).
- Diagonal T(s,s) of triangle A059836.A059837
Diagonal T(s,s) of triangle A059836.
- Number of permutations in the symmetric group S_n that have even order.A059838
Number of permutations in the symmetric group S_n that have even order.
- a(n) = n^8 + n^6 + n^4 + n^2 + 1.A059839
a(n) = n^8 + n^6 + n^4 + n^2 + 1.
- a(n) = F(n)*F(n-1) if n odd otherwise F(n)*F(n-1)-1, where F = Fibonacci numbers A000045.A059840
a(n) = F(n)*F(n-1) if n odd otherwise F(n)*F(n-1)-1, where F = Fibonacci numbers A000045.
- Period 2: Repeat [1,0]. a(n) = 1 - (n mod 2); Characteristic function of even numbers.A059841
Period 2: Repeat [1,0]. a(n) = 1 - (n mod 2); Characteristic function of even numbers.
- The next square after a(n)^3 is a(n+1)^2.A059842
The next square after a(n)^3 is a(n+1)^2.
- a(n) is the smallest prime p such that p-n is a nonzero square.A059843
a(n) is the smallest prime p such that p-n is a nonzero square.
- a(n) = smallest nonzero square x^2 such that n+x^2 is prime.A059844
a(n) = smallest nonzero square x^2 such that n+x^2 is prime.
- a(n) = n*(3*n + 11)/2.A059845
a(n) = n*(3*n + 11)/2.
- a(n) is the least prime p, such that next_prime(2*p) - 2*p = 2*n - 1.A059846
a(n) is the least prime p, such that next_prime(2*p) - 2*p = 2*n - 1.
- a(n) = 2*p + 2*n - 1, where p is the least prime such that next_prime(2*p) - 2*p = 2*n - 1.A059847
a(n) = 2*p + 2*n - 1, where p is the least prime such that next_prime(2*p) - 2*p = 2*n - 1.
- As a square table by antidiagonals, the n-digit number which in base k starts 1010101...A059848
As a square table by antidiagonals, the n-digit number which in base k starts 1010101...
- Number of pairs of partitions of {1,2,...,n} whose meet is the partition {{1}, {2}, ..., {n}}.A059849
Number of pairs of partitions of {1,2,...,n} whose meet is the partition {{1}, {2}, ..., {n}}.
- Decimal expansion of Pi^e.A059850
Decimal expansion of Pi^e.
- a(n) = n - floor(n/2) + floor(n/3) - floor(n/4) + ... (this is a finite sum).A059851
a(n) = n - floor(n/2) + floor(n/3) - floor(n/4) + ... (this is a finite sum).
- Consider the English alphabet in Morse code (the International Morse radio telegraph code). Map a 'dit' to the digit one and a 'dah' to the digit 2, then express that ternary number in decimal.A059852
Consider the English alphabet in Morse code (the International Morse radio telegraph code). Map a 'dit' to the digit one and a 'dah' to the digit 2, then express that ternary number in decimal.
- Period of continued fraction for sqrt(n^2+3), n >= 2.A059853
Period of continued fraction for sqrt(n^2+3), n >= 2.
- Period of continued fraction for sqrt(n^2+5), n >= 3.A059854
Period of continued fraction for sqrt(n^2+5), n >= 3.
- Period of continued fraction for sqrt(n^2+4), n >= 1.A059855
Period of continued fraction for sqrt(n^2+4), n >= 1.
- Write down decimal expansion of Euler-Mascheroni constant gamma (A001620); divide up into minimal chunks so that chunks have increasing length and do not begin with zero.A059856
Write down decimal expansion of Euler-Mascheroni constant gamma (A001620); divide up into minimal chunks so that chunks have increasing length and do not begin with zero.
- Alternating clock-face numbers.A059857
Alternating clock-face numbers.
- Primes p such that x^5 == 2 (mod p) has five solutions.A059858
Primes p such that x^5 == 2 (mod p) has five solutions.
- Sum of squares of first n quarter-squares (A002620).A059859
Sum of squares of first n quarter-squares (A002620).
- a(n) = binomial(n+1, 2)^5.A059860
a(n) = binomial(n+1, 2)^5.