Sequences
392,541 sequences
- a(n) = round(exp(n * Pi)).A062511
a(n) = round(exp(n * Pi)).
- a(n) = floor( gamma(n/4) * gamma(n+1)/4 ).A062512
a(n) = floor( gamma(n/4) * gamma(n+1)/4 ).
- Product of unitary divisors of n is divided by n^(number of distinct prime factors).A062513
Product of unitary divisors of n is divided by n^(number of distinct prime factors).
- Numbers k such that sigma(phi(k)) is a prime.A062514
Numbers k such that sigma(phi(k)) is a prime.
- Leading least prime signatures, ordered by forming the product of primorials greater than 2 with multiplicities given by the canonical sequence of partitions.A062515
Leading least prime signatures, ordered by forming the product of primorials greater than 2 with multiplicities given by the canonical sequence of partitions.
- Numbers k such that 2*tau(k) = phi(k).A062516
Numbers k such that 2*tau(k) = phi(k).
- Number of primes between n^5 and (n+1)^5.A062517
Number of primes between n^5 and (n+1)^5.
- Conjectural largest exponent k such that n^k does not contain all of the digits 0 through 9 (in decimal notation) or 0 if no such k exists (for example if n is a power of 10).A062518
Conjectural largest exponent k such that n^k does not contain all of the digits 0 through 9 (in decimal notation) or 0 if no such k exists (for example if n is a power of 10).
- Numbers for which (product of digits) / (sum of digits) is an integer > 1.A062519
Numbers for which (product of digits) / (sum of digits) is an integer > 1.
- 3^a(n) is smallest nonnegative power of 3 containing n.A062520
3^a(n) is smallest nonnegative power of 3 containing n.
- 4^a(n) is smallest nonnegative power of 4 containing the string 'n'.A062521
4^a(n) is smallest nonnegative power of 4 containing the string 'n'.
- 5^a(n) is smallest nonnegative power of 5 containing the string 'n'.A062522
5^a(n) is smallest nonnegative power of 5 containing the string 'n'.
- 6^a(n) is smallest nonnegative power of 6 containing the string 'n'.A062523
6^a(n) is smallest nonnegative power of 6 containing the string 'n'.
- 7^a(n) is smallest nonnegative power of 7 containing the string 'n'.A062524
7^a(n) is smallest nonnegative power of 7 containing the string 'n'.
- 8^a(n) is smallest power of 8 containing the string 'n'.A062525
8^a(n) is smallest power of 8 containing the string 'n'.
- 9^a(n) is smallest power of 9 containing the string 'n'.A062526
9^a(n) is smallest power of 9 containing the string 'n'.
- Smallest number (>1) which appears at least n times in Pascal's triangle.A062527
Smallest number (>1) which appears at least n times in Pascal's triangle.
- Number of ways to fill an n X n matrix with numbers 1, 2, ..., n*n such that each row and each column is decreasing or increasing.A062528
Number of ways to fill an n X n matrix with numbers 1, 2, ..., n*n such that each row and each column is decreasing or increasing.
- Smallest prime p such that there is a gap of 2^n between p and the next prime.A062529
Smallest prime p such that there is a gap of 2^n between p and the next prime.
- Smallest prime p such that there is a gap of 2^n between p and previous prime.A062530
Smallest prime p such that there is a gap of 2^n between p and previous prime.
- Index of smallest prime p such that there is a gap of 2^n between p and next prime.A062531
Index of smallest prime p such that there is a gap of 2^n between p and next prime.
- Odd nonprimes squared, or A014076(n)^2.A062532
Odd nonprimes squared, or A014076(n)^2.
- a(n) = A000010(A014076(n)).A062533
a(n) = A000010(A014076(n)).
- Table by antidiagonals of coefficient of x^k in expansion of 1/((1+x)^2*(1-x)^n).A062534
Table by antidiagonals of coefficient of x^k in expansion of 1/((1+x)^2*(1-x)^n).
- Don't be greedy! Difference between number of squares needed to sum to n using the greedy algorithm and using the best such sum.A062535
Don't be greedy! Difference between number of squares needed to sum to n using the greedy algorithm and using the best such sum.
- Increasing values for the radius of the inner Soddy circle associated with three unequal kissing circles, the four radii of the system forming a primitive quadruple.A062536
Increasing values for the radius of the inner Soddy circle associated with three unequal kissing circles, the four radii of the system forming a primitive quadruple.
- Nodes in riff (rooted index-functional forest) for n.A062537
Nodes in riff (rooted index-functional forest) for n.
- Primes of the form 4*k! + 1.A062538
Primes of the form 4*k! + 1.
- Decimal expansion of the Lemniscate constant or Gauss's constant.A062539
Decimal expansion of the Lemniscate constant or Gauss's constant.
- Continued fraction for the Lemniscate constant or Gauss's constant.A062540
Continued fraction for the Lemniscate constant or Gauss's constant.
- a(n) = floor(Pi^n * e^n).A062541
a(n) = floor(Pi^n * e^n).
- Decimal expansion of the continued fraction constant (base 10).A062542
Decimal expansion of the continued fraction constant (base 10).
- Continued fraction expansion of continued fractions constant (base 10).A062543
Continued fraction expansion of continued fractions constant (base 10).
- a(n) = n plus sum of previous three terms.A062544
a(n) = n plus sum of previous three terms.
- Continued fraction for the 2nd du Bois-Reymond constant.A062545
Continued fraction for the 2nd du Bois-Reymond constant.
- Decimal expansion of the 2nd Du Bois-Reymond constant.A062546
Decimal expansion of the 2nd Du Bois-Reymond constant.
- a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).A062547
a(n) is least odd integer not a partial sum of 1, 3, ..., a(n-1).
- Even integers that are not partial sums of A062547.A062548
Even integers that are not partial sums of A062547.
- a(n) is the smallest number m such that m! is divisible by the left factorial !n (A003422).A062549
a(n) is the smallest number m such that m! is divisible by the left factorial !n (A003422).
- a(n) = Sum_{k = 1..2n} floor(2n/k).A062550
a(n) = Sum_{k = 1..2n} floor(2n/k).
- Primes of the form 3*k! + 1.A062551
Primes of the form 3*k! + 1.
- Number of cyclic subgroups of Chevalley group A_n(4) (the group of nonsingular n X n matrices over GF(4) ).A062552
Number of cyclic subgroups of Chevalley group A_n(4) (the group of nonsingular n X n matrices over GF(4) ).
- Number of Abelian subgroups of the dihedral group with 2n elements.A062553
Number of Abelian subgroups of the dihedral group with 2n elements.
- Products of numbers of faces of Platonic solids, i.e., of {4,6,8,12,20}.A062554
Products of numbers of faces of Platonic solids, i.e., of {4,6,8,12,20}.
- Squares that are the concatenation of three numbers, one of which is the sum of the other two.A062555
Squares that are the concatenation of three numbers, one of which is the sum of the other two.
- Cubes that are the concatenation of three numbers, one of which is the sum of the other two.A062556
Cubes that are the concatenation of three numbers, one of which is the sum of the other two.
- 2n-1 1's followed by a 2.A062557
2n-1 1's followed by a 2.
- Number of nonisomorphic cyclic subgroups of dihedral group with 2n elements.A062558
Number of nonisomorphic cyclic subgroups of dihedral group with 2n elements.
- A B2 sequence consisting of powers of primes but not primes: a(n) = least value from A025475 such that sequence increases and pairwise sums of distinct elements are all distinct.A062559
A B2 sequence consisting of powers of primes but not primes: a(n) = least value from A025475 such that sequence increases and pairwise sums of distinct elements are all distinct.
- The first few denominators in the odd-greedy expansion of 5/139.A062560
The first few denominators in the odd-greedy expansion of 5/139.