Sequences
392,541 sequences
- Primes p such that A001414(p-1) = A001414(p+1), where A001414 = sum of primes dividing n (with repetition).A086711
Primes p such that A001414(p-1) = A001414(p+1), where A001414 = sum of primes dividing n (with repetition).
- Number of times the n-th prime power can be written as an arithmetic mean of two other prime powers.A086712
Number of times the n-th prime power can be written as an arithmetic mean of two other prime powers.
- A squarefree sequence: define a mapping from the set of strings over the alphabet {0,1,2} by f(0)=01201, f(1)=020121, f(2)=0212021 and f of the concatenation of s and t is the concatenation of f(s) and f(t). Then each of 0, f(0), f(f(0)), ... is an initial substring of the next; their limit is the infinite sequence given above.A086713
A squarefree sequence: define a mapping from the set of strings over the alphabet {0,1,2} by f(0)=01201, f(1)=020121, f(2)=0212021 and f of the concatenation of s and t is the concatenation of f(s) and f(t). Then each of 0, f(0), f(f(0)), ... is an initial substring of the next; their limit is the infinite sequence given above.
- a(1) = 4, a(n) = a(n-1)*(a(n-1) - 1)/2.A086714
a(1) = 4, a(n) = a(n-1)*(a(n-1) - 1)/2.
- Primes p such that A001414(p-1) and A001414(p+1) are both prime, where A001414 = sum of primes dividing n (with repetition).A086715
Primes p such that A001414(p-1) and A001414(p+1) are both prime, where A001414 = sum of primes dividing n (with repetition).
- Convolution of triangular numbers with partition numbers.A086716
Convolution of triangular numbers with partition numbers.
- Convolution of primes with partition numbers.A086717
Convolution of primes with partition numbers.
- Convolution of sequence of primes with sequence sigma(n).A086718
Convolution of sequence of primes with sequence sigma(n).
- Numbers n == 1, 2, 5 or 6 (mod 8) such that there is only one solution to i^2+j^2+k^2=n, i >= j >= k >= 0.A086719
Numbers n == 1, 2, 5 or 6 (mod 8) such that there is only one solution to i^2+j^2+k^2=n, i >= j >= k >= 0.
- Numerator of Sum(binomial(n,k)/(n^2+k^2+1), k=0..n).A086720
Numerator of Sum(binomial(n,k)/(n^2+k^2+1), k=0..n).
- Denominator of Sum_{k=0..n} binomial(n,k)/(n^2+k^2+1).A086721
Denominator of Sum_{k=0..n} binomial(n,k)/(n^2+k^2+1).
- Decimal expansion of g(1)+g(2)-g(4)-g(5), where g(k) = Sum_{m>=0} (1/(6*m+k)^2).A086722
Decimal expansion of g(1)+g(2)-g(4)-g(5), where g(k) = Sum_{m>=0} (1/(6*m+k)^2).
- Decimal expansion of 1/(g(1)+g(2)-g(4)-g(5)), where g(k) = sum(1/(6*m+k)^2,m=0..infinity).A086723
Decimal expansion of 1/(g(1)+g(2)-g(4)-g(5)), where g(k) = sum(1/(6*m+k)^2,m=0..infinity).
- Decimal expansion of L(2, chi3) = g(1)-g(2)+g(4)-g(5), where g(k) = Sum_{m>=0} (1/(6*m+k)^2).A086724
Decimal expansion of L(2, chi3) = g(1)-g(2)+g(4)-g(5), where g(k) = Sum_{m>=0} (1/(6*m+k)^2).
- Decimal expansion of 1/(g(1)-g(2)+g(4)-g(5)), where g(k) = Sum_{m>=0} 1/(6*m+k)^2.A086725
Decimal expansion of 1/(g(1)-g(2)+g(4)-g(5)), where g(k) = Sum_{m>=0} 1/(6*m+k)^2.
- Decimal expansion of sum(1/(6*m)^2,m=1..infinity).A086726
Decimal expansion of sum(1/(6*m)^2,m=1..infinity).
- Decimal expansion of sum(1/(6*m+1)^2,m=0..infinity).A086727
Decimal expansion of sum(1/(6*m+1)^2,m=0..infinity).
- Decimal expansion of sum(1/(6*m+2)^2,m=0..infinity).A086728
Decimal expansion of sum(1/(6*m+2)^2,m=0..infinity).
- Decimal expansion of Pi^2/72.A086729
Decimal expansion of Pi^2/72.
- Decimal expansion of sum(1/(6*m+4)^2,m=0..infinity).A086730
Decimal expansion of sum(1/(6*m+4)^2,m=0..infinity).
- Decimal expansion of sum(1/(6*m+5)^2,m=0..infinity).A086731
Decimal expansion of sum(1/(6*m+5)^2,m=0..infinity).
- Convolution of A000203 with partition function (A000041) of positive integers.A086732
Convolution of A000203 with partition function (A000041) of positive integers.
- Convolution of sigma(n) with phi(n).A086733
Convolution of sigma(n) with phi(n).
- Convolution of the prime numbers with phi(n).A086734
Convolution of the prime numbers with phi(n).
- Convolution of the prime numbers with phi(n) convoluted with sigma(n).A086735
Convolution of the prime numbers with phi(n) convoluted with sigma(n).
- Sum(j=1,n,floor(A000041(j)/j)).A086736
Sum(j=1,n,floor(A000041(j)/j)).
- a(n) = A000217(A000041(n)).A086737
a(n) = A000217(A000041(n)).
- A000041(n) - A000203(n).A086738
A000041(n) - A000203(n).
- A000041(n)-A000010(n).A086739
A000041(n)-A000010(n).
- Floor(A000041(n)/n).A086740
Floor(A000041(n)/n).
- a(n) = A026905(n) - A014284(n).A086741
a(n) = A026905(n) - A014284(n).
- Start with a(0)=1, then k-th run is 1,2,3,..., a(0) + a(1) + a(2) + ... + a(k-1).A086742
Start with a(0)=1, then k-th run is 1,2,3,..., a(0) + a(1) + a(2) + ... + a(k-1).
- Numbers n such that the coefficient of x^n equals 0 in Product_{k>=1} (1 - x^(3^k)).A086743
Numbers n such that the coefficient of x^n equals 0 in Product_{k>=1} (1 - x^(3^k)).
- Decimal expansion of Product_{n>=1} (2n/(2n+1))^((-1)^t(n)), where t(n) = A010060(n) is the Thue-Morse sequence.A086744
Decimal expansion of Product_{n>=1} (2n/(2n+1))^((-1)^t(n)), where t(n) = A010060(n) is the Thue-Morse sequence.
- Duplicate of A086646.A086745
Duplicate of A086646.
- Multiples of 3018.A086746
Multiples of 3018.
- Baum-Sweet sequence: a(n) = 1 if binary representation of n contains no block of consecutive zeros of odd length; otherwise a(n) = 0.A086747
Baum-Sweet sequence: a(n) = 1 if binary representation of n contains no block of consecutive zeros of odd length; otherwise a(n) = 0.
- Odd numbers m such that when C(2k, k) == 1 (mod m) then k is necessarily even.A086748
Odd numbers m such that when C(2k, k) == 1 (mod m) then k is necessarily even.
- Partial sums of A038580.A086749
Partial sums of A038580.
- Duplicate of A086749.A086750
Duplicate of A086749.
- Decimal expansion of the solution to x*sqrt(1-x^2) + arcsin(x) = Pi/4, or the length of the line connecting the origin to the center of the chord of a circle, centered at 0 and of radius 1, that divides the circle such that 1/4 of the area is on one side and 3/4 is on the other side.A086751
Decimal expansion of the solution to x*sqrt(1-x^2) + arcsin(x) = Pi/4, or the length of the line connecting the origin to the center of the chord of a circle, centered at 0 and of radius 1, that divides the circle such that 1/4 of the area is on one side and 3/4 is on the other side.
- Number of n X n matrices over GF(3) with rank n-1.A086752
Number of n X n matrices over GF(3) with rank n-1.
- Number of distinct entries in a slice of A046816.A086753
Number of distinct entries in a slice of A046816.
- Pascal's square pyramid read by slices, each slice being read by rows. Each entry in slice n is the sum of the 4 entries above it in slice n-1.A086754
Pascal's square pyramid read by slices, each slice being read by rows. Each entry in slice n is the sum of the 4 entries above it in slice n-1.
- Sum_{k=1..n} (k(k+1))^2/2.A086755
Sum_{k=1..n} (k(k+1))^2/2.
- a(n) = n^n mod 10^n.A086756
a(n) = n^n mod 10^n.
- Smallest prime p such that n is a palindrome in base-p representation.A086757
Smallest prime p such that n is a palindrome in base-p representation.
- a(n) is the smallest m such that the integer part of the first n powers of m^(1/n) are primes.A086758
a(n) is the smallest m such that the integer part of the first n powers of m^(1/n) are primes.
- Permanent of the Cayley addition table of Z_{n}. a(n) is the permanent of the n X n matrix M_(i,j) = ((i+j) mod n) where i and j range from 0 to n-1.A086759
Permanent of the Cayley addition table of Z_{n}. a(n) is the permanent of the n X n matrix M_(i,j) = ((i+j) mod n) where i and j range from 0 to n-1.
- a(n) = 8*n^2 + 88*n + 43.A086760
a(n) = 8*n^2 + 88*n + 43.