Sequences
392,541 sequences
- a(n+1) is next smallest nontrivial square beginning with a(n), initial square is 9.A048561
a(n+1) is next smallest nontrivial square beginning with a(n), initial square is 9.
- a(n+1)^2 is next smallest nontrivial square beginning with a(n)^2, initial square is 9.A048562
a(n+1)^2 is next smallest nontrivial square beginning with a(n)^2, initial square is 9.
- a(n+1) is next smallest nontrivial cube beginning with a(n), initial cube is 1.A048563
a(n+1) is next smallest nontrivial cube beginning with a(n), initial cube is 1.
- a(n+1)^3 is next smallest nontrivial cube beginning with a(n)^3, initial cube is 1.A048564
a(n+1)^3 is next smallest nontrivial cube beginning with a(n)^3, initial cube is 1.
- a(n+1) is next smallest nontrivial cube beginning with a(n), initial cube is 8.A048565
a(n+1) is next smallest nontrivial cube beginning with a(n), initial cube is 8.
- a(n+1)^3 is next smallest nontrivial cube beginning with a(n)^3, initial cube is 8.A048566
a(n+1)^3 is next smallest nontrivial cube beginning with a(n)^3, initial cube is 8.
- a(n+1) is next smallest nontrivial cube beginning with a(n), initial cube is 27.A048567
a(n+1) is next smallest nontrivial cube beginning with a(n), initial cube is 27.
- a(n+1)^3 is next smallest nontrivial cube beginning with a(n)^3, initial cube is 27.A048568
a(n+1)^3 is next smallest nontrivial cube beginning with a(n)^3, initial cube is 27.
- Values of k for which the number of divisors of the central binomial coefficient C(k, floor(k/2)) exceeds the number of divisors of all other binomial coefficients C(k,j).A048569
Values of k for which the number of divisors of the central binomial coefficient C(k, floor(k/2)) exceeds the number of divisors of all other binomial coefficients C(k,j).
- Triangle T(n,k) = number of divisors of binomial(n,k).A048570
Triangle T(n,k) = number of divisors of binomial(n,k).
- Triangle read by rows: T(n,k) = number of distinct prime factors of C(n,k).A048571
Triangle read by rows: T(n,k) = number of distinct prime factors of C(n,k).
- a(n) = sum of digits of a(n-1)*a(n-2).A048572
a(n) = sum of digits of a(n-1)*a(n-2).
- a(n) = a(n-1) + 2*a(n-2), a(0)=2, a(1)=3.A048573
a(n) = a(n-1) + 2*a(n-2), a(0)=2, a(1)=3.
- Self-convolution of 1 2 3 5 7 11 15 22 30 42 56 77 ... (A000041).A048574
Self-convolution of 1 2 3 5 7 11 15 22 30 42 56 77 ... (A000041).
- Pisot sequences L(2,5), E(2,5).A048575
Pisot sequences L(2,5), E(2,5).
- Pisot sequence L(2,7).A048576
Pisot sequence L(2,7).
- Pisot sequence L(3,4).A048577
Pisot sequence L(3,4).
- Pisot sequence L(3,5).A048578
Pisot sequence L(3,5).
- Pisot sequence L(3,8).A048579
Pisot sequence L(3,8).
- Pisot sequence L(3,10).A048580
Pisot sequence L(3,10).
- Numerators of b(n) = (1/16^n)*(4/(8*n+1) - 2/(8*n+4) - 1/(8*n+5) - 1/(8*n+6)).A048581
Numerators of b(n) = (1/16^n)*(4/(8*n+1) - 2/(8*n+4) - 1/(8*n+5) - 1/(8*n+6)).
- Pisot sequence L(4,9).A048582
Pisot sequence L(4,9).
- Pisot sequence L(5,6).A048583
Pisot sequence L(5,6).
- Pisot sequence L(5,7).A048584
Pisot sequence L(5,7).
- Pisot sequence L(6,7).A048585
Pisot sequence L(6,7).
- Pisot sequence L(6,8).A048586
Pisot sequence L(6,8).
- Pisot sequence L(6,10).A048587
Pisot sequence L(6,10).
- Pisot sequence L(7,8).A048588
Pisot sequence L(7,8).
- Pisot sequence L(7,9).A048589
Pisot sequence L(7,9).
- Pisot sequence L(8,9).A048590
Pisot sequence L(8,9).
- Pisot sequence L(8,10).A048591
Pisot sequence L(8,10).
- Pisot sequence L(9,10).A048592
Pisot sequence L(9,10).
- Converse numbers: composite Fibonacci numbers Fib(k) that are congruent to Legendre symbol (k/5) mod k.A048593
Converse numbers: composite Fibonacci numbers Fib(k) that are congruent to Legendre symbol (k/5) mod k.
- Triangle T(n,k) = k! * Stirling1(n,k), 1<=k<=n.A048594
Triangle T(n,k) = k! * Stirling1(n,k), 1<=k<=n.
- Alternative start to A002371, which is the main entry for this sequence.A048595
Alternative start to A002371, which is the main entry for this sequence.
- Numbers k such that (k mod (sum of decimal digits of k)) divides k.A048596
Numbers k such that (k mod (sum of decimal digits of k)) divides k.
- Very round numbers: reduced residue system consists of only primes and 1.A048597
Very round numbers: reduced residue system consists of only primes and 1.
- Partial sums of the sequence (A001097) of twin primes.A048598
Partial sums of the sequence (A001097) of twin primes.
- Partial products of the sequence (A001097) of twin primes.A048599
Partial products of the sequence (A001097) of twin primes.
- Array a(n,k) = number of colors that can be produced by n units of paint from k primary colors, read by descending antidiagonals.A048600
Array a(n,k) = number of colors that can be produced by n units of paint from k primary colors, read by descending antidiagonals.
- Robbins triangle read by rows: T(n,k) = number of alternating sign n X n matrices with a 1 at top of column k (n >= 1, 1<=k<=n).A048601
Robbins triangle read by rows: T(n,k) = number of alternating sign n X n matrices with a 1 at top of column k (n >= 1, 1<=k<=n).
- Numerators of coefficients in function a(x) such that a(a(x)) = sin(x).A048602
Numerators of coefficients in function a(x) such that a(a(x)) = sin(x).
- Denominators of coefficients in function a(x) such that a(a(x)) = sin x.A048603
Denominators of coefficients in function a(x) such that a(a(x)) = sin x.
- Denominators of coefficients in function a(x) such that a(a(x)) = arctan(x).A048604
Denominators of coefficients in function a(x) such that a(a(x)) = arctan(x).
- Numerators of coefficients in function a(x) such that a(a(x)) = arctan(x).A048605
Numerators of coefficients in function a(x) such that a(a(x)) = arctan(x).
- Numerators of coefficients in function a(x) such that a(a(x)) = sinh(x).A048606
Numerators of coefficients in function a(x) such that a(a(x)) = sinh(x).
- Numerators of coefficients in function a(x) such that a(a(x)) = log(1+x).A048607
Numerators of coefficients in function a(x) such that a(a(x)) = log(1+x).
- Denominators of coefficients in function a(x) such that a(a(x)) = log(1+x).A048608
Denominators of coefficients in function a(x) such that a(a(x)) = log(1+x).
- Duplicate of A048603.A048609
Duplicate of A048603.
- Smallest number that is the sum of two positive squares in >= n ways.A048610
Smallest number that is the sum of two positive squares in >= n ways.