Sequences
392,541 sequences
- a(n) = Sum_{k=1..n} binomial(prime(n),k).A064811
a(n) = Sum_{k=1..n} binomial(prime(n),k).
- Smallest prime p such that the infinite sequence {p, p'=2p-1, p''=2p'-1, ...} begins with a string of exactly n primes.A064812
Smallest prime p such that the infinite sequence {p, p'=2p-1, p''=2p'-1, ...} begins with a string of exactly n primes.
- a(n) = binomial(composite(n), n), where composite = A002808, composite numbers.A064813
a(n) = binomial(composite(n), n), where composite = A002808, composite numbers.
- Greatest common divisor of n and the n-th composite number.A064814
Greatest common divisor of n and the n-th composite number.
- Related to enumeration of finite automata.A064815
Related to enumeration of finite automata.
- Numbers which are the sums of two positive triangular numbers (A000217) in exactly two different ways.A064816
Numbers which are the sums of two positive triangular numbers (A000217) in exactly two different ways.
- Maximal number of squares among the n-1 numbers p_i + p_{i+1}, 1 <= i <= n-1, where (p_1, ..., p_n) is any permutation of (1, ..., n).A064817
Maximal number of squares among the n-1 numbers p_i + p_{i+1}, 1 <= i <= n-1, where (p_1, ..., p_n) is any permutation of (1, ..., n).
- Exotic numbers: write n in base 10 as d_1 d_2 ... d_k; sequence gives numbers n which can be obtained by using the digits d_1 ... d_k exactly once, at most one each of the symbols +, -, x, "divided by", sqrt, factorial, ^, together with any number of parentheses.A064818
Exotic numbers: write n in base 10 as d_1 d_2 ... d_k; sequence gives numbers n which can be obtained by using the digits d_1 ... d_k exactly once, at most one each of the symbols +, -, x, "divided by", sqrt, factorial, ^, together with any number of parentheses.
- a(n) = p(1)*p(2)*...*p(n) - p(n+1)^2, where p(i) = i-th prime.A064819
a(n) = p(1)*p(2)*...*p(n) - p(n+1)^2, where p(i) = i-th prime.
- a(n) = Product_{k=1..4*n-9} prime(k) - prime(4n)^4 where prime(i) = i-th prime.A064820
a(n) = Product_{k=1..4*n-9} prime(k) - prime(4n)^4 where prime(i) = i-th prime.
- Number of ways of writing the numbers 1 .. n in a sequence so that the sum of any two adjacent numbers is a prime; reversing the sequence does not count as different.A064821
Number of ways of writing the numbers 1 .. n in a sequence so that the sum of any two adjacent numbers is a prime; reversing the sequence does not count as different.
- Number of indices 1 <= i <= n with A001113(i)=A001113(n).A064822
Number of indices 1 <= i <= n with A001113(i)=A001113(n).
- Number of indices 1 <= i <= n with A000796(i)=A000796(n).A064823
Number of indices 1 <= i <= n with A000796(i)=A000796(n).
- Same as A065191 but with B_[1]=( i mod 10, i=0,1,2,3..).A064824
Same as A065191 but with B_[1]=( i mod 10, i=0,1,2,3..).
- Numbers which are the sums of three positive triangular numbers in exactly two different ways.A064825
Numbers which are the sums of three positive triangular numbers in exactly two different ways.
- Numbers which are the sum of two pentagonal numbers (A000326) in exactly two different ways.A064826
Numbers which are the sum of two pentagonal numbers (A000326) in exactly two different ways.
- Numbers k such that each digit of k occurs among the digits of k^2.A064827
Numbers k such that each digit of k occurs among the digits of k^2.
- Numbers which are the sum of two positive triangular numbers in exactly three different ways.A064828
Numbers which are the sum of two positive triangular numbers in exactly three different ways.
- Smallest number greater than 1 which ends in an odd digit in bases 2 through n.A064829
Smallest number greater than 1 which ends in an odd digit in bases 2 through n.
- a(n) = gcd(n, prime(n)^2 - 1).A064830
a(n) = gcd(n, prime(n)^2 - 1).
- Partial sums of A001654, or sum of the areas of the first n Fibonacci rectangles.A064831
Partial sums of A001654, or sum of the areas of the first n Fibonacci rectangles.
- Record numbers in A064791.A064832
Record numbers in A064791.
- Indices of record numbers in A064791.A064833
Indices of record numbers in A064791.
- If n (in base 10) is d_1 d_2 ... d_k then a(n) = Sum_{i = 1..[k/2] } |d_i - d_{k-i+1}|.A064834
If n (in base 10) is d_1 d_2 ... d_k then a(n) = Sum_{i = 1..[k/2] } |d_i - d_{k-i+1}|.
- If n mod 2 = 0 then a(n) = n^4/4 - 2*n^2 + 3*n; otherwise, a(n) = n^4/4 - 2*n^2 + 3*n - 5/4.A064835
If n mod 2 = 0 then a(n) = n^4/4 - 2*n^2 + 3*n; otherwise, a(n) = n^4/4 - 2*n^2 + 3*n - 5/4.
- a(n) = A064835(n)/2.A064836
a(n) = A064835(n)/2.
- a(n) = (6*n^4 + 30*n^3 - 20*n^2 + 14)*n/30 + (n mod 2).A064837
a(n) = (6*n^4 + 30*n^3 - 20*n^2 + 14)*n/30 + (n mod 2).
- a(n) = A064837(n)/2.A064838
a(n) = A064837(n)/2.
- List the natural numbers starting a new row only with each new least prime signature (A025487). a(n) is the column position associated with n.A064839
List the natural numbers starting a new row only with each new least prime signature (A025487). a(n) is the column position associated with n.
- a(n) = tau(n)*sigma(n).A064840
a(n) = tau(n)*sigma(n).
- Working in base 2, replace n with the concatenation of its prime divisors in increasing order.A064841
Working in base 2, replace n with the concatenation of its prime divisors in increasing order.
- Maximal value of Sum_{i=1..n} (p(i) - p(i+1))^2, where p(n+1) = p(1), as p ranges over all permutations of {1, 2, ..., n}.A064842
Maximal value of Sum_{i=1..n} (p(i) - p(i+1))^2, where p(n+1) = p(1), as p ranges over all permutations of {1, 2, ..., n}.
- a(n) = A064842(n)/2.A064843
a(n) = A064842(n)/2.
- Number of iterations of x -> x + A064834(x) to reach a palindrome, starting with n (or -1 if no palindrome is ever reached).A064844
Number of iterations of x -> x + A064834(x) to reach a palindrome, starting with n (or -1 if no palindrome is ever reached).
- Let r_1 = 1; r_{n+1} = [r_1; r_2, r_3,..., r_n]; n-th term is numerator of r_n.A064845
Let r_1 = 1; r_{n+1} = [r_1; r_2, r_3,..., r_n]; n-th term is numerator of r_n.
- Let r_1 = 1; r_{n+1} = [r_1; r_2, r_3,..., r_n]; n-th term is denominator of r_n.A064846
Let r_1 = 1; r_{n+1} = [r_1; r_2, r_3,..., r_n]; n-th term is denominator of r_n.
- Sequence a(n) such that there is a sequence b(n) with a(1) = b(1) = 1, a(n+1) = a(n) * b(n) and b(n+1) = a(n) + b(n) for n >= 1.A064847
Sequence a(n) such that there is a sequence b(n) with a(1) = b(1) = 1, a(n+1) = a(n) * b(n) and b(n+1) = a(n) + b(n) for n >= 1.
- Period of continued fraction for sqrt(2)*n.A064848
Period of continued fraction for sqrt(2)*n.
- Period of continued fraction for sqrt(3)*n.A064849
Period of continued fraction for sqrt(3)*n.
- Period of continued fraction for sqrt(5)*n.A064850
Period of continued fraction for sqrt(5)*n.
- Period of continued fraction for sqrt(6)*n.A064851
Period of continued fraction for sqrt(6)*n.
- Number of orbits in A002619 consisting of n permutations.A064852
Number of orbits in A002619 consisting of n permutations.
- Decimal expansion of the Lemniscate constant.A064853
Decimal expansion of the Lemniscate constant.
- a(n) = ((5^n mod 4^n) mod 3^n) mod 2^n.A064854
a(n) = ((5^n mod 4^n) mod 3^n) mod 2^n.
- a(n) = (((6^n mod 5^n) mod 4^n) mod 3^n) mod 2^n.A064855
a(n) = (((6^n mod 5^n) mod 4^n) mod 3^n) mod 2^n.
- Stirling transform of Catalan numbers: a(n) = Sum_{k=0..n} Stirling2(n, k)*binomial(2*k, k) / (k+1).A064856
Stirling transform of Catalan numbers: a(n) = Sum_{k=0..n} Stirling2(n, k)*binomial(2*k, k) / (k+1).
- Numerators of partial sums of reciprocals of lcm(1..n) = A003418(n).A064857
Numerators of partial sums of reciprocals of lcm(1..n) = A003418(n).
- Denominators of partial sums of reciprocals of lcm(1..n) = A003418(n).A064858
Denominators of partial sums of reciprocals of lcm(1..n) = A003418(n).
- Decimal expansion of sum of reciprocals of lcm(1..n) = A003418(n).A064859
Decimal expansion of sum of reciprocals of lcm(1..n) = A003418(n).
- Period of continued fraction for sqrt(7)*n.A064860
Period of continued fraction for sqrt(7)*n.