Sequences
392,541 sequences
- A log based Cantor self similar sequence.A088661
A log based Cantor self similar sequence.
- Number of peaks at even level in all symmetric Dyck paths of semilength n+2.A088662
Number of peaks at even level in all symmetric Dyck paths of semilength n+2.
- p[n_, k_]=Product[(E/(2-E))^i, {i, 1, n}]/Product[(E/(2-E))^i, {i, Floor[n/2^k], n}], a(n) = Sum[Floor[p[n, k]/(8*p[n-1, k])], {k, 1, 8}].A088663
p[n_, k_]=Product[(E/(2-E))^i, {i, 1, n}]/Product[(E/(2-E))^i, {i, Floor[n/2^k], n}], a(n) = Sum[Floor[p[n, k]/(8*p[n-1, k])], {k, 1, 8}].
- Duplicate of A023219.A088664
Duplicate of A023219.
- q such that p^4 + q^4 = r^4 + s^4 = a(n).A088665
q such that p^4 + q^4 = r^4 + s^4 = a(n).
- a(n) = (n^4 + 1) mod 10.A088666
a(n) = (n^4 + 1) mod 10.
- n^4 + 6 mod 10.A088667
n^4 + 6 mod 10.
- Number of n X n matrices over GF(2) with characteristic polynomial x^(n-1) * (x-1).A088668
Number of n X n matrices over GF(2) with characteristic polynomial x^(n-1) * (x-1).
- Number of partitions of n into decimal repdigit numbers.A088669
Number of partitions of n into decimal repdigit numbers.
- Number of partitions of n into distinct decimal repdigit numbers.A088670
Number of partitions of n into distinct decimal repdigit numbers.
- Number of n X n matrices over GF(3) with characteristic polynomial x^(n-1) * (x-1).A088671
Number of n X n matrices over GF(3) with characteristic polynomial x^(n-1) * (x-1).
- Number of n X n (0,1)-matrices with zero permanent.A088672
Number of n X n (0,1)-matrices with zero permanent.
- a(n) = n mod A002024(n), where A002024 is "n appears n times": 1, 2, 2, 3, 3, 3, ...A088673
a(n) = n mod A002024(n), where A002024 is "n appears n times": 1, 2, 2, 3, 3, 3, ...
- Coefficients of the eigenfunction of a sequence transformation.A088674
Coefficients of the eigenfunction of a sequence transformation.
- G.f. A(x) satisfies x = (1 + 4*A(x)) * A(A(x)).A088675
G.f. A(x) satisfies x = (1 + 4*A(x)) * A(A(x)).
- Values of "i" in A087732 and the index of the prime in A087731.A088676
Values of "i" in A087732 and the index of the prime in A087731.
- Numbers that can be represented as j^6 + k^6, with 0 < j < k, in exactly one way.A088677
Numbers that can be represented as j^6 + k^6, with 0 < j < k, in exactly one way.
- Number of polybes.A088678
Number of polybes.
- a(n) = a(n-1)^2 * n / (n-1), n>1, a(0) = 0, a(1) = 1.A088679
a(n) = a(n-1)^2 * n / (n-1), n>1, a(0) = 0, a(1) = 1.
- a(n) = prime(2n+1) - prime(2n).A088680
a(n) = prime(2n+1) - prime(2n).
- Duplicate of A078584.A088681
Duplicate of A078584.
- a(n) = prime(3*n+1) - prime(3*n-1).A088682
a(n) = prime(3*n+1) - prime(3*n-1).
- a(n) = prime(3*n+2) - prime(3*n).A088683
a(n) = prime(3*n+2) - prime(3*n).
- Prime(3n+3)-prime(3n+1).A088684
Prime(3n+3)-prime(3n+1).
- Records for the sum-of-primes function sopfr(n) if sopfr(prime) is taken to be 0.A088685
Records for the sum-of-primes function sopfr(n) if sopfr(prime) is taken to be 0.
- Positions of the records in the sum-of-primes function sopfr(n) if sopfr(prime) is taken to be 0.A088686
Positions of the records in the sum-of-primes function sopfr(n) if sopfr(prime) is taken to be 0.
- Numbers that can be represented as j^4 + k^4, with 0 < j < k, in exactly one way.A088687
Numbers that can be represented as j^4 + k^4, with 0 < j < k, in exactly one way.
- Binomial transform of A088689.A088688
Binomial transform of A088689.
- Jacobsthal numbers modulo 3.A088689
Jacobsthal numbers modulo 3.
- E.g.f.: A(x) = f(x*A(x)), where f(x) = (1+x)*exp(x).A088690
E.g.f.: A(x) = f(x*A(x)), where f(x) = (1+x)*exp(x).
- E.g.f.: A(x) = f(x*A(x)^2), where f(x) = exp(arctan(x)).A088691
E.g.f.: A(x) = f(x*A(x)^2), where f(x) = exp(arctan(x)).
- E.g.f: A(x) = f(x*A(x)), where f(x) = (1+2*x)*exp(x).A088692
E.g.f: A(x) = f(x*A(x)), where f(x) = (1+2*x)*exp(x).
- E.g.f: A(x) = f(x*A(x)^2), where f(x) = (1+3*x)*exp(x).A088693
E.g.f: A(x) = f(x*A(x)^2), where f(x) = (1+3*x)*exp(x).
- E.g.f: A(x) = f(x*A(x)^3), where f(x) = (1+4*x)*exp(x).A088694
E.g.f: A(x) = f(x*A(x)^3), where f(x) = (1+4*x)*exp(x).
- E.g.f. satisfies A(x) = f(x*A(x)), where f(x) = exp(x+x^2).A088695
E.g.f. satisfies A(x) = f(x*A(x)), where f(x) = exp(x+x^2).
- Triangle read by rows, giving number of partial quotients in continued fraction representation of terms in the left branch of the infinite Stern-Brocot tree.A088696
Triangle read by rows, giving number of partial quotients in continued fraction representation of terms in the left branch of the infinite Stern-Brocot tree.
- Replace 0 with 10 in binary representation of n.A088697
Replace 0 with 10 in binary representation of n.
- Replace 1 with 11 in binary representation of n.A088698
Replace 1 with 11 in binary representation of n.
- Array read by antidiagonals of coefficients of generating function exp(x)/(1-y-xy).A088699
Array read by antidiagonals of coefficients of generating function exp(x)/(1-y-xy).
- Number of primes between successive semiprimes.A088700
Number of primes between successive semiprimes.
- Smallest semiprime such that n primes will follow until the next semiprime.A088701
Smallest semiprime such that n primes will follow until the next semiprime.
- Number of polygons with polygonal holes on the square lattice enumerated by half-perimeter.A088702
Number of polygons with polygonal holes on the square lattice enumerated by half-perimeter.
- Numbers of form x^5 + y^5, x,y > 0 and x <> y.A088703
Numbers of form x^5 + y^5, x,y > 0 and x <> y.
- a(n) equals the coefficient of x^n in f(x)^n where f(x)=1+sum(n>=0,x^(2^n)).A088704
a(n) equals the coefficient of x^n in f(x)^n where f(x)=1+sum(n>=0,x^(2^n)).
- First differences of A000120. One minus exponent of 2 in n.A088705
First differences of A000120. One minus exponent of 2 in n.
- Duplicate of A087710.A088706
Duplicate of A087710.
- Semiprimes + 1.A088707
Semiprimes + 1.
- Numbers m which are a product of two primes j and k such that m+j-k and m-j+k are both primes.A088708
Numbers m which are a product of two primes j and k such that m+j-k and m-j+k are both primes.
- Numbers m that are a product of two primes j and k such that m+j+k is prime.A088709
Numbers m that are a product of two primes j and k such that m+j+k is prime.
- Numbers m which are a product of two primes j and k such that m-j-k is prime.A088710
Numbers m which are a product of two primes j and k such that m-j-k is prime.