Sequences
392,541 sequences
- a(n+1) = next smallest prime beginning with a(n) when written in binary, starting with 2.A055011
a(n+1) = next smallest prime beginning with a(n) when written in binary, starting with 2.
- Sum of cubes of the digits of n written in base 10.A055012
Sum of cubes of the digits of n written in base 10.
- Sum of 4th powers of digits of n.A055013
Sum of 4th powers of digits of n.
- Sum of 5th powers of digits of n.A055014
Sum of 5th powers of digits of n.
- Sum of 6th powers of digits of n.A055015
Sum of 6th powers of digits of n.
- Smallest number whose sum of squares of digits is n.A055016
Smallest number whose sum of squares of digits is n.
- Difference between sums of alternate digits of n starting with the last, i.e., (sum of ultimate digit of n, antepenultimate digit of n, ...) - (sum of penultimate digit of n, preantepenultimate digit of n, ...).A055017
Difference between sums of alternate digits of n starting with the last, i.e., (sum of ultimate digit of n, antepenultimate digit of n, ...) - (sum of penultimate digit of n, preantepenultimate digit of n, ...).
- Numbers k such that k and k+1 are modest (cf. A054986).A055018
Numbers k such that k and k+1 are modest (cf. A054986).
- Numbers n such that A051885(p_n) is prime, where p_n=A000040(n) is the n-th prime.A055019
Numbers n such that A051885(p_n) is prime, where p_n=A000040(n) is the n-th prime.
- Number of iterations of sigma() required until 2n (or greater) is reached.A055020
Number of iterations of sigma() required until 2n (or greater) is reached.
- Smallest number k such that n iterations of sigma() are required for the result to be >= 2k.A055021
Smallest number k such that n iterations of sigma() are required for the result to be >= 2k.
- Number of 1-punctured staircase polygons (by perimeter) with a hole of perimeter 4.A055022
Number of 1-punctured staircase polygons (by perimeter) with a hole of perimeter 4.
- a(n) = n/A055032(n).A055023
a(n) = n/A055032(n).
- Number of 1-punctured staircase polygons (by perimeter) with a hole of perimeter 6.A055024
Number of 1-punctured staircase polygons (by perimeter) with a hole of perimeter 6.
- Norms of Gaussian primes.A055025
Norms of Gaussian primes.
- Number of Gaussian primes of successive norms (indexed by A055025).A055026
Number of Gaussian primes of successive norms (indexed by A055025).
- Number of inequivalent Gaussian primes of successive norms (indexed by A055025).A055027
Number of inequivalent Gaussian primes of successive norms (indexed by A055025).
- Number of Gaussian primes of norm n.A055028
Number of Gaussian primes of norm n.
- Number of inequivalent Gaussian primes of norm n.A055029
Number of inequivalent Gaussian primes of norm n.
- (Sum(m^(p-1),m=1..p-1)+1)/p as p runs through the primes.A055030
(Sum(m^(p-1),m=1..p-1)+1)/p as p runs through the primes.
- Numerator of (Sum(m^(n-1),m=1..n-1)+1)/n.A055031
Numerator of (Sum(m^(n-1),m=1..n-1)+1)/n.
- Denominator of (Sum(m^(n-1),m=1..n-1)+1)/n.A055032
Denominator of (Sum(m^(n-1),m=1..n-1)+1)/n.
- a(n) = usigma(usigma(n)), where usigma(n) is the sum of unitary divisors of n (A034448).A055033
a(n) = usigma(usigma(n)), where usigma(n) is the sum of unitary divisors of n (A034448).
- a(1) = 1, a(n) = phi(2*n)/2 for n > 1.A055034
a(1) = 1, a(n) = phi(2*n)/2 for n > 1.
- Degree of minimal polynomial of sin(Pi/n) over the rationals.A055035
Degree of minimal polynomial of sin(Pi/n) over the rationals.
- Min[x] composite zero site for sigma(x+6^n) - sigma(x) - 6^n.A055036
Min[x] composite zero site for sigma(x+6^n) - sigma(x) - 6^n.
- Number of numbers <= n with an even number of prime factors (counted with multiplicity).A055037
Number of numbers <= n with an even number of prime factors (counted with multiplicity).
- Number of numbers <= n with an odd number of prime factors (counted with multiplicity).A055038
Number of numbers <= n with an odd number of prime factors (counted with multiplicity).
- Numbers of the form 2^(2i+1)*(8j+7).A055039
Numbers of the form 2^(2i+1)*(8j+7).
- Numbers of the form 3^(2i+1)*(3*j+2).A055040
Numbers of the form 3^(2i+1)*(3*j+2).
- Numbers of the form 3^(2i+1)*(3*j+1).A055041
Numbers of the form 3^(2i+1)*(3*j+1).
- Numbers of the form 2^(2i+1)*(8*j+5).A055042
Numbers of the form 2^(2i+1)*(8*j+5).
- Numbers of the form 2^(2i+1)*(8*j+3).A055043
Numbers of the form 2^(2i+1)*(8*j+3).
- Numbers of the form 2^(2i+1)*(8*j+1).A055044
Numbers of the form 2^(2i+1)*(8*j+1).
- Numbers of the form 4^i*(8*j+5).A055045
Numbers of the form 4^i*(8*j+5).
- Numbers of the form 4^i*(8*j+3).A055046
Numbers of the form 4^i*(8*j+3).
- Numbers of the form 9^i*(3*j+1).A055047
Numbers of the form 9^i*(3*j+1).
- Numbers of the form 9^i*(3*j+2).A055048
Numbers of the form 9^i*(3*j+2).
- Numbers of the form 5^(2*i+1)*(5*j+-2).A055049
Numbers of the form 5^(2*i+1)*(5*j+-2).
- Numbers of the form 4^i*(8*j+3) or 4^i*(8*j+7).A055050
Numbers of the form 4^i*(8*j+3) or 4^i*(8*j+7).
- Numbers of the form 2^(2i+1)*(8j+7), 2^(2i+1)*(16j+6) or 2^(2i+1)*(4j+3).A055051
Numbers of the form 2^(2i+1)*(8j+7), 2^(2i+1)*(16j+6) or 2^(2i+1)*(4j+3).
- Numbers of the form 4^i*(8j+7) or 4^i*(8j+5).A055052
Numbers of the form 4^i*(8j+7) or 4^i*(8j+5).
- Numbers of the form 4^i*(8j+7) or 4^i*(5j+-2).A055053
Numbers of the form 4^i*(8j+7) or 4^i*(5j+-2).
- Numbers of the form 4^i*(8j+7) or 4^i*(3j+1).A055054
Numbers of the form 4^i*(8j+7) or 4^i*(3j+1).
- Number of basic magic carpets on n points.A055055
Number of basic magic carpets on n points.
- Number of smooth basic magic carpets on n points.A055056
Number of smooth basic magic carpets on n points.
- Largest k value that admits an (n,k) smooth magic carpet.A055057
Largest k value that admits an (n,k) smooth magic carpet.
- Primes in A054632.A055058
Primes in A054632.
- Positions in A007376 where the partial sums (A054632) yield primes (A055058).A055059
Positions in A007376 where the partial sums (A054632) yield primes (A055058).
- Decimal expansion of Komornik-Loreti constant.A055060
Decimal expansion of Komornik-Loreti constant.