Sequences
392,541 sequences
- Decimal expansion of the real number whose continued fraction is defined by the property that the k-th partial quotient is the period of the continued fraction for sqrt(k).A053011
Decimal expansion of the real number whose continued fraction is defined by the property that the k-th partial quotient is the period of the continued fraction for sqrt(k).
- Platonic numbers: a(n) is a tetrahedral (A000292), cube (A000578), octahedral (A005900), dodecahedral (A006566) or icosahedral (A006564) number.A053012
Platonic numbers: a(n) is a tetrahedral (A000292), cube (A000578), octahedral (A005900), dodecahedral (A006566) or icosahedral (A006564) number.
- Positions in decimal expansion of Pi where next prime begins.A053013
Positions in decimal expansion of Pi where next prime begins.
- a(n) is the smallest number which has n consecutive divisors k, k+1, ..., k+n-1 such that the quotients all begin with the same digit.A053014
a(n) is the smallest number which has n consecutive divisors k, k+1, ..., k+n-1 such that the quotients all begin with the same digit.
- A089210 prefixed by an initial zero.A053015
A089210 prefixed by an initial zero.
- Numbers of vertices of Platonic solids in the order tetrahedron, octahedron, cube, icosahedron, dodecahedron.A053016
Numbers of vertices of Platonic solids in the order tetrahedron, octahedron, cube, icosahedron, dodecahedron.
- Let Do(n) = A006566(n) = n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k>0, with Do(i) = Do(j) + Do(k), ordered by increasing i; sequence gives i values.A053017
Let Do(n) = A006566(n) = n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k>0, with Do(i) = Do(j) + Do(k), ordered by increasing i; sequence gives i values.
- Let Do(n)=A006566(n)=n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k>0, with Do(i)=Do(j)+Do(k), ordered by increasing i; sequence gives j values.A053018
Let Do(n)=A006566(n)=n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k>0, with Do(i)=Do(j)+Do(k), ordered by increasing i; sequence gives j values.
- Let Do(n) = A006566(n) = n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Do(i) = Do(j) + Do(k), ordered by increasing i; sequence gives k values.A053019
Let Do(n) = A006566(n) = n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Do(i) = Do(j) + Do(k), ordered by increasing i; sequence gives k values.
- Numbers which, when expressed as a sum of distinct primes with maximum product, use a non-maximal number of primes.A053020
Numbers which, when expressed as a sum of distinct primes with maximum product, use a non-maximal number of primes.
- Number of divisors function applied twice to n!.A053021
Number of divisors function applied twice to n!.
- Number of subdiagonal directed diagonally-convex animals with given diagonal semiperimeter.A053022
Number of subdiagonal directed diagonally-convex animals with given diagonal semiperimeter.
- Divisor function applied thrice to n!.A053023
Divisor function applied thrice to n!.
- a(n) = n*p where p is the next prime >= n.A053024
a(n) = n*p where p is the next prime >= n.
- Number of iterations of the number of divisors function (A000005) required to reach a fixed point (1 or 2) when started at n!.A053025
Number of iterations of the number of divisors function (A000005) required to reach a fixed point (1 or 2) when started at n!.
- Maximum power of 2 arising when A000005 is applied repeatedly to n!.A053026
Maximum power of 2 arising when A000005 is applied repeatedly to n!.
- Odd primes p with 2 zeros in Fibonacci numbers mod p.A053027
Odd primes p with 2 zeros in Fibonacci numbers mod p.
- Odd primes p with 4 zeros in any period of the Fibonacci numbers mod p.A053028
Odd primes p with 4 zeros in any period of the Fibonacci numbers mod p.
- Numbers with 4 zeros in Fibonacci numbers mod m.A053029
Numbers with 4 zeros in Fibonacci numbers mod m.
- Numbers with 2 zeros in Fibonacci numbers mod m.A053030
Numbers with 2 zeros in Fibonacci numbers mod m.
- Numbers with 1 zero in Fibonacci numbers mod m.A053031
Numbers with 1 zero in Fibonacci numbers mod m.
- Odd primes p with one zero in Fibonacci numbers mod p.A053032
Odd primes p with one zero in Fibonacci numbers mod p.
- Numbers which are the average of two primes in more ways than any smaller number.A053033
Numbers which are the average of two primes in more ways than any smaller number.
- Length of sequence when A051953 (cototient function) is repeatedly applied starting with n!.A053034
Length of sequence when A051953 (cototient function) is repeatedly applied starting with n!.
- Number of powers of 2 in the iteration-sequence when A051953 (cototient function) is repeatedly applied starting with n!.A053035
Number of powers of 2 in the iteration-sequence when A051953 (cototient function) is repeatedly applied starting with n!.
- Number of values which are not powers of 2 in the trajectory when A051953 (cototient function) is repeatedly applied starting with n!.A053036
Number of values which are not powers of 2 in the trajectory when A051953 (cototient function) is repeatedly applied starting with n!.
- Number of self-complementary types of Boolean functions of n variables under action of AG(n,2).A053037
Number of self-complementary types of Boolean functions of n variables under action of AG(n,2).
- The first (largest) power of 2 arising in the iteration-sequence when A051953 (the cototient function) is repeatedly applied starting with n!.A053038
The first (largest) power of 2 arising in the iteration-sequence when A051953 (the cototient function) is repeatedly applied starting with n!.
- Exponent of largest power of 2 which appears in the cototient-iteration started with n!.A053039
Exponent of largest power of 2 which appears in the cototient-iteration started with n!.
- Number of self-complementary types of Boolean functions of n variables under action of affine self-dual group M(n,2).A053040
Number of self-complementary types of Boolean functions of n variables under action of affine self-dual group M(n,2).
- Smallest n-digit number divisible by n.A053041
Smallest n-digit number divisible by n.
- a(n) = n^n + n!.A053042
a(n) = n^n + n!.
- Number of facets of hypermetric correlation cone.A053043
Number of facets of hypermetric correlation cone.
- a(n) is the number of iterations of the Euler totient function to reach 1, starting at n!.A053044
a(n) is the number of iterations of the Euler totient function to reach 1, starting at n!.
- a(n) is the number of powers of 2 among the iterates of the Euler phi function when it is iterated with initial value n!.A053045
a(n) is the number of powers of 2 among the iterates of the Euler phi function when it is iterated with initial value n!.
- a(n) is the number of terms that are not powers of 2 among the iterates of the Euler phi function when it is iterated with initial value n!.A053046
a(n) is the number of terms that are not powers of 2 among the iterates of the Euler phi function when it is iterated with initial value n!.
- a(n) is the first (and maximal) power of 2 arising during iterations of the Euler phi function with initial value n!.A053047
a(n) is the first (and maximal) power of 2 arising during iterations of the Euler phi function with initial value n!.
- a(n) is the number of terminal iterations applied to powers of 2 arising in the iterations of the Euler phi function with initial value n!.A053048
a(n) is the number of terminal iterations applied to powers of 2 arising in the iterations of the Euler phi function with initial value n!.
- Smallest integer m such that sum_(k=1 to m) phi(k) is divisible by n, where phi(k) is the totient function.A053049
Smallest integer m such that sum_(k=1 to m) phi(k) is divisible by n, where phi(k) is the totient function.
- a(n) = smallest integer m such that Sum_{k=1..m} prime(k) is divisible by n.A053050
a(n) = smallest integer m such that Sum_{k=1..m} prime(k) is divisible by n.
- Smallest integer m such that Sum_{k=1..m} d(k) is divisible by n, where d(k) (A000005) is the number of divisors of k.A053051
Smallest integer m such that Sum_{k=1..m} d(k) is divisible by n, where d(k) (A000005) is the number of divisors of k.
- Append n to the previous term, reverse alternate terms.A053052
Append n to the previous term, reverse alternate terms.
- Append n-th prime to previous term, reverse alternate terms.A053053
Append n-th prime to previous term, reverse alternate terms.
- Append n-th palindromic prime to previous term, reverse alternate terms.A053054
Append n-th palindromic prime to previous term, reverse alternate terms.
- Append n-th Fibonacci number to previous term, reverse alternate terms.A053055
Append n-th Fibonacci number to previous term, reverse alternate terms.
- Fibonacci numbers whose digit sum is also a Fibonacci number.A053056
Fibonacci numbers whose digit sum is also a Fibonacci number.
- Squares whose digit sum is also a square.A053057
Squares whose digit sum is also a square.
- Cubes whose digit sum is also a cube.A053058
Cubes whose digit sum is also a cube.
- Squares whose product of digits is also a nonzero square.A053059
Squares whose product of digits is also a nonzero square.
- Number of n X n invertible binary matrices A such that A^3+I is invertible.A053060
Number of n X n invertible binary matrices A such that A^3+I is invertible.