Sequences
392,541 sequences
- Integers for which the periodic part of the continued fraction for the square root of n begins with 8.A065011
Integers for which the periodic part of the continued fraction for the square root of n begins with 8.
- Integers for which the periodic part of the continued fraction for the square root of n begins with 9.A065012
Integers for which the periodic part of the continued fraction for the square root of n begins with 9.
- Integers for which the periodic part of the continued fraction for the square root of n begins with 10.A065013
Integers for which the periodic part of the continued fraction for the square root of n begins with 10.
- Duplicate of A013945.A065014
Duplicate of A013945.
- Sum divides product: number of integer solutions (w,x,y,z), w >= x >= y >= z > 0, to the equation w*x*y*z = n*(w+x+y+z).A065015
Sum divides product: number of integer solutions (w,x,y,z), w >= x >= y >= z > 0, to the equation w*x*y*z = n*(w+x+y+z).
- Working in base 2, replace n with the concatenation of its prime factors (without repetition).A065016
Working in base 2, replace n with the concatenation of its prime factors (without repetition).
- Primes of the form p*q + p + q, where (p, q=p+2) are twin primes.A065017
Primes of the form p*q + p + q, where (p, q=p+2) are twin primes.
- a(n) = Sum_{d|n} sigma(d)^2.A065018
a(n) = Sum_{d|n} sigma(d)^2.
- Let phi be the golden number {1+sqrt(5)}/2 (A001622), let phi(n) be the number phi written in base 10 but truncated to n decimal digits. Sequence gives number of 1's at the beginning of the continued fraction expansion of phi(n).A065019
Let phi be the golden number {1+sqrt(5)}/2 (A001622), let phi(n) be the number phi written in base 10 but truncated to n decimal digits. Sequence gives number of 1's at the beginning of the continued fraction expansion of phi(n).
- Coefficients of irreducible polynomials over GF(3) listed in lexicographic order.A065020
Coefficients of irreducible polynomials over GF(3) listed in lexicographic order.
- Duplicate of A048652.A065021
Duplicate of A048652.
- Composite n such that the sums of the composite numbers up to n, +/- 1, are twin primes.A065022
Composite n such that the sums of the composite numbers up to n, +/- 1, are twin primes.
- Number of states in minimal automaton that recognizes biquanimous numbers in base n.A065023
Number of states in minimal automaton that recognizes biquanimous numbers in base n.
- Number of n-digit biquanimous numbers in base 10 allowing leading zeros.A065024
Number of n-digit biquanimous numbers in base 10 allowing leading zeros.
- Consider biquanimous numbers that exclude 0's; sequence gives number of n-digit non-biquanimous numbers - number of n-digit biquanimous numbers.A065025
Consider biquanimous numbers that exclude 0's; sequence gives number of n-digit non-biquanimous numbers - number of n-digit biquanimous numbers.
- a(1) = 1; for n>1, a(n) = smallest number that is not a sum or product of any subset of the numbers a(1) to a(n-1).A065026
a(1) = 1; for n>1, a(n) = smallest number that is not a sum or product of any subset of the numbers a(1) to a(n-1).
- a(n) is the smallest k > 0 such that n^k < k!.A065027
a(n) is the smallest k > 0 such that n^k < k!.
- Integers which when written in French contain an odd number of vowels.A065028
Integers which when written in French contain an odd number of vowels.
- Numbers k such that the period of the continued fraction for sqrt(2)*k (A064848) is 2.A065029
Numbers k such that the period of the continued fraction for sqrt(2)*k (A064848) is 2.
- Numbers k such that the period of the continued fraction for sqrt(5)*k is 2.A065030
Numbers k such that the period of the continued fraction for sqrt(5)*k is 2.
- In the decimal expansion of n, replace each odd digit with 1 and each even digit with 2.A065031
In the decimal expansion of n, replace each odd digit with 1 and each even digit with 2.
- Erroneous version of A007514.A065032
Erroneous version of A007514.
- 1 appears three times, other numbers twice.A065033
1 appears three times, other numbers twice.
- a(n) = Lucas(2*n) + 1.A065034
a(n) = Lucas(2*n) + 1.
- a(n+1) = a(n)^2 + 3*a(n) + 1.A065035
a(n+1) = a(n)^2 + 3*a(n) + 1.
- Product of the cube of a prime (A030078) and a different prime.A065036
Product of the cube of a prime (A030078) and a different prime.
- Inverse permutation to A036552.A065037
Inverse permutation to A036552.
- Values of Recamán's sequence A005132 at start of n-th segment (see A064492).A065038
Values of Recamán's sequence A005132 at start of n-th segment (see A064492).
- If n in base 10 is d_1 d_2 ... d_k then a(n) = d_1 + d_1d_2 + d_1d_2d_3 + ... + d_1...d_k.A065039
If n in base 10 is d_1 d_2 ... d_k then a(n) = d_1 + d_1d_2 + d_1d_2d_3 + ... + d_1...d_k.
- Triangle read by rows: T(m,k) = exponent of the highest power of 2 dividing the binomial coefficient binomial(m,k).A065040
Triangle read by rows: T(m,k) = exponent of the highest power of 2 dividing the binomial coefficient binomial(m,k).
- Duplicate of A065393.A065041
Duplicate of A065393.
- Numbers k such that prime(k) + pi(k) is a prime.A065042
Numbers k such that prime(k) + pi(k) is a prime.
- Characteristic function of the numbers with an even number of prime factors (counted with multiplicity): a(n) = 1 if n = A028260(k) for some k then 1 else 0.A065043
Characteristic function of the numbers with an even number of prime factors (counted with multiplicity): a(n) = 1 if n = A028260(k) for some k then 1 else 0.
- Start of the first run of exactly n consecutive primes, none of which are twin primes.A065044
Start of the first run of exactly n consecutive primes, none of which are twin primes.
- Continued fraction expansion of the constant Product_{k>=0} (1 + 1/2^(2k))^(1/2) (A065445).A065045
Continued fraction expansion of the constant Product_{k>=0} (1 + 1/2^(2k))^(1/2) (A065445).
- Numbers k such that prime(k) - pi(k) is a prime.A065046
Numbers k such that prime(k) - pi(k) is a prime.
- Primes which when written in base 2 and prepended with a 1 produce a prime.A065047
Primes which when written in base 2 and prepended with a 1 produce a prime.
- Largest unsigned Stirling number of the first kind: max_k(s(n+1,k)); i.e., largest coefficient of polynomial x*(x+1)*(x+2)*(x+3)*...*(x+n).A065048
Largest unsigned Stirling number of the first kind: max_k(s(n+1,k)); i.e., largest coefficient of polynomial x*(x+1)*(x+2)*(x+3)*...*(x+n).
- Odd primes of incorrect parity: number of 1's in the binary representation of n (mod 2) == 1 - (n mod 3) (mod 2). Also called isolated primes.A065049
Odd primes of incorrect parity: number of 1's in the binary representation of n (mod 2) == 1 - (n mod 3) (mod 2). Also called isolated primes.
- Prime numbers in the triangle of Eulerian numbers.A065050
Prime numbers in the triangle of Eulerian numbers.
- Let R(n) = n-th term of Recamán's sequence A005132; write R(n) = q*n + r with 0 <= r < n; sequence gives values of q.A065051
Let R(n) = n-th term of Recamán's sequence A005132; write R(n) = q*n + r with 0 <= r < n; sequence gives values of q.
- Let R(n) = n-th term of Recamán's sequence A005132; write R(n) = q*n + r with 0 <= r < n; sequence gives values of r.A065052
Let R(n) = n-th term of Recamán's sequence A005132; write R(n) = q*n + r with 0 <= r < n; sequence gives values of r.
- Lengths of intervals between special points in Recamán's sequence A005132.A065053
Lengths of intervals between special points in Recamán's sequence A005132.
- Value of remainder r (see A065052) at start of n-th interval between special points in Recamán's sequence A005132.A065054
Value of remainder r (see A065052) at start of n-th interval between special points in Recamán's sequence A005132.
- Number of subtraction steps in n-th interval between special points in Recamán's sequence A005132.A065055
Number of subtraction steps in n-th interval between special points in Recamán's sequence A005132.
- Partial sums of Recamán's sequence A005132.A065056
Partial sums of Recamán's sequence A005132.
- Partial sums of A064413.A065057
Partial sums of A064413.
- Number of paths to T(n,n,n) with T(i,j,k)= 0 if j>i or k>j and T(i,j,k) = T(i-1,j,k) + T(i,j-1,k) + T(i,j,k-1) and T(i,j,0) = 1.A065058
Number of paths to T(n,n,n) with T(i,j,k)= 0 if j>i or k>j and T(i,j,k) = T(i-1,j,k) + T(i,j-1,k) + T(i,j,k-1) and T(i,j,0) = 1.
- Primes p such that prime(p) + pi(p) is a prime.A065059
Primes p such that prime(p) + pi(p) is a prime.
- Primes p such that prime(p) - pi(p) is a prime.A065060
Primes p such that prime(p) - pi(p) is a prime.