Sequences
392,541 sequences
- "Product" of the sequence of primes and the "evil" numbers (A001969).A092861
"Product" of the sequence of primes and the "evil" numbers (A001969).
- "Square" of the prime sequence.A092862
"Square" of the prime sequence.
- Prime sequence to the power Pi.A092863
Prime sequence to the power Pi.
- Greatest common divisor of triples a,b,c such that a < b < c, (a*b) mod (a+b) = c, (b*c) mod (b+c) = a, (c*a) mod (c+a) = b. The triples are ordered according to sum of first and second component.A092864
Greatest common divisor of triples a,b,c such that a < b < c, (a*b) mod (a+b) = c, (b*c) mod (b+c) = a, (c*a) mod (c+a) = b. The triples are ordered according to sum of first and second component.
- Nonzero elements in Klee's identity Sum[(-1)^k binomial[n,k]binomial[n+k,m],{k,0,n}] == (-1)^n binomial[n,m-n].A092865
Nonzero elements in Klee's identity Sum[(-1)^k binomial[n,k]binomial[n+k,m],{k,0,n}] == (-1)^n binomial[n,m-n].
- Number of intersections inside an equilateral triangular figure formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts. If three or more lines meet at an interior point this intersection is counted only once.A092866
Number of intersections inside an equilateral triangular figure formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts. If three or more lines meet at an interior point this intersection is counted only once.
- Number of regions in an equilateral triangular figure formed by the straight line segments connecting all vertices and all points that divide the sides into n equal parts.A092867
Number of regions in an equilateral triangular figure formed by the straight line segments connecting all vertices and all points that divide the sides into n equal parts.
- Coefficients c[r,n] in Schmidt's problem Sum[Binomial[n,k]^r Binomial[n+k,k]^r,{k,0,n}] == Sum[Binomial[n,k]Binomial[n+k,k]c[r,k],{k,0,n}] for r=4.A092868
Coefficients c[r,n] in Schmidt's problem Sum[Binomial[n,k]^r Binomial[n+k,k]^r,{k,0,n}] == Sum[Binomial[n,k]Binomial[n+k,k]c[r,k],{k,0,n}] for r=4.
- Series expansion of the Ramanujan-Goellnitz-Gordon continued fraction.A092869
Series expansion of the Ramanujan-Goellnitz-Gordon continued fraction.
- Expansion of Hypergeometric function F(1/12, 5/12; 1; 1728*x) in powers of x.A092870
Expansion of Hypergeometric function F(1/12, 5/12; 1; 1728*x) in powers of x.
- Number of composites < 10^n.A092871
Number of composites < 10^n.
- Expansion of r(q^9) / (r(q) r(q^3)) in powers of q where r() is the Rogers-Ramanujan continued fraction function (A007325).A092872
Expansion of r(q^9) / (r(q) r(q^3)) in powers of q where r() is the Rogers-Ramanujan continued fraction function (A007325).
- Prime factors of the odd terms of A007755.A092873
Prime factors of the odd terms of A007755.
- Decimal expansion of the "binary" Liouville number.A092874
Decimal expansion of the "binary" Liouville number.
- Aronson transform of the "evil" sequence (A001969).A092875
Aronson transform of the "evil" sequence (A001969).
- Expansion of q * (f(-q, -q^12) * f(-q^3, -q^10) * f(-q^4, -q^9)) / (f(-q^2, -q^11) * f(-q^5, -q^8) * f(-q^6, -q^7)) in powers of q where f(, ) is Ramanujan's general theta function.A092876
Expansion of q * (f(-q, -q^12) * f(-q^3, -q^10) * f(-q^4, -q^9)) / (f(-q^2, -q^11) * f(-q^5, -q^8) * f(-q^6, -q^7)) in powers of q where f(, ) is Ramanujan's general theta function.
- Expansion of (eta(q^4) / eta(q))^8 in powers of q.A092877
Expansion of (eta(q^4) / eta(q))^8 in powers of q.
- Number of initial odd numbers in class n of the iterated phi function.A092878
Number of initial odd numbers in class n of the iterated phi function.
- Triangle of coefficients of the product of two consecutive Fibonacci polynomials.A092879
Triangle of coefficients of the product of two consecutive Fibonacci polynomials.
- Number of ordered 2-multiantichains on an n-set.A092880
Number of ordered 2-multiantichains on an n-set.
- Number of ordered 3-multiantichains on an n-set.A092881
Number of ordered 3-multiantichains on an n-set.
- Number of ordered 4-multiantichains on an n-set.A092882
Number of ordered 4-multiantichains on an n-set.
- Number of ordered 5-multiantichains on an n-set.A092883
Number of ordered 5-multiantichains on an n-set.
- Number of ordered 6-multiantichains on an n-set.A092884
Number of ordered 6-multiantichains on an n-set.
- Number of partitions of n in which no parts are multiples of 25.A092885
Number of partitions of n in which no parts are multiples of 25.
- Expansion of x/(x^4-x^3-2x^2-x+1).A092886
Expansion of x/(x^4-x^3-2x^2-x+1).
- First component of quadruples a,b,c,d such that a < b < c < d, (a*b*c) mod (a+b+c) = d, (a*b*d) mod (a+b+d) = c, (a*c*d) mod (a+c+d) = b, (b*c*d) mod (b+c+d) = a. The quadruples are ordered according to sum of first three components, secondary by first component, thirdly by second component.A092887
First component of quadruples a,b,c,d such that a < b < c < d, (a*b*c) mod (a+b+c) = d, (a*b*d) mod (a+b+d) = c, (a*c*d) mod (a+c+d) = b, (b*c*d) mod (b+c+d) = a. The quadruples are ordered according to sum of first three components, secondary by first component, thirdly by second component.
- Second component of quadruples a,b,c,d such that a < b < c < d, (a*b*c) mod (a+b+c) = d, (a*b*d) mod (a+b+d) = c, (a*c*d) mod (a+c+d) = b, (b*c*d) mod (b+c+d) = a. The quadruples are ordered according to sum of first three components, secondary by first component, thirdly by second component.A092888
Second component of quadruples a,b,c,d such that a < b < c < d, (a*b*c) mod (a+b+c) = d, (a*b*d) mod (a+b+d) = c, (a*c*d) mod (a+c+d) = b, (b*c*d) mod (b+c+d) = a. The quadruples are ordered according to sum of first three components, secondary by first component, thirdly by second component.
- Third component of quadruples a,b,c,d such that a < b < c < d, (a*b*c) mod (a+b+c) = d, (a*b*d) mod (a+b+d) = c, (a*c*d) mod (a+c+d) = b, (b*c*d) mod (b+c+d) = a. The quadruples are ordered according to sum of first three components, secondary by first component, thirdly by second component.A092889
Third component of quadruples a,b,c,d such that a < b < c < d, (a*b*c) mod (a+b+c) = d, (a*b*d) mod (a+b+d) = c, (a*c*d) mod (a+c+d) = b, (b*c*d) mod (b+c+d) = a. The quadruples are ordered according to sum of first three components, secondary by first component, thirdly by second component.
- Fourth component of quadruples a,b,c,d such that a < b < c < d, (a*b*c) mod (a+b+c) = d, (a*b*d) mod (a+b+d) = c, (a*c*d) mod (a+c+d) = b, (b*c*d) mod (b+c+d) = a. The quadruples are ordered according to sum of first three components, secondary by first component, thirdly by second component.A092890
Fourth component of quadruples a,b,c,d such that a < b < c < d, (a*b*c) mod (a+b+c) = d, (a*b*d) mod (a+b+d) = c, (a*c*d) mod (a+c+d) = b, (b*c*d) mod (b+c+d) = a. The quadruples are ordered according to sum of first three components, secondary by first component, thirdly by second component.
- Greatest common divisor of quadruples a,b,c,d such that a < b < c < d, (a*b*c) mod (a+b+c) = d, (a*b*d) mod (a+b+d) = c, (a*c*d) mod (a+c+d) = b, (b*c*d) mod (b+c+d) = a. The quadruples are ordered according to sum of first three components, secondary by first component, thirdly by second component.A092891
Greatest common divisor of quadruples a,b,c,d such that a < b < c < d, (a*b*c) mod (a+b+c) = d, (a*b*d) mod (a+b+d) = c, (a*c*d) mod (a+c+d) = b, (b*c*d) mod (b+c+d) = a. The quadruples are ordered according to sum of first three components, secondary by first component, thirdly by second component.
- Smallest starting value in a Collatz '3x+1' sequence such that the sequence contains exactly n halving steps.A092892
Smallest starting value in a Collatz '3x+1' sequence such that the sequence contains exactly n halving steps.
- Smallest starting value in a Collatz '3x+1' sequence such that the sequence contains exactly n tripling steps.A092893
Smallest starting value in a Collatz '3x+1' sequence such that the sequence contains exactly n tripling steps.
- Decimal expansion of Frederick Magata's constant.A092894
Decimal expansion of Frederick Magata's constant.
- Continued fraction expansion of Frederick Magata's constant.A092895
Continued fraction expansion of Frederick Magata's constant.
- Related to random walks on the 4-cube.A092896
Related to random walks on the 4-cube.
- Expansion of (1-x-x^2-3*x^3) / ((1+x)^2*(1-3*x)).A092897
Expansion of (1-x-x^2-3*x^3) / ((1+x)^2*(1-3*x)).
- Expansion of (1 - 4*x + 4*x^2 - 4*x^3)/(1 - 4*x).A092898
Expansion of (1 - 4*x + 4*x^2 - 4*x^3)/(1 - 4*x).
- Expansion of (1+2x+3x^2+6x^3)/((1+x)(1-x)^2).A092899
Expansion of (1+2x+3x^2+6x^3)/((1+x)(1-x)^2).
- A Jacobsthal sequence (A078008) to base 4.A092900
A Jacobsthal sequence (A078008) to base 4.
- Number of irregular primes (A000928) less than 10^n.A092901
Number of irregular primes (A000928) less than 10^n.
- Round(prime(n)/log[10](prime(n))).A092902
Round(prime(n)/log[10](prime(n))).
- Duplicate of A005153.A092903
Duplicate of A005153.
- Number of decimal digits in the denominator of the Bernoulli number B(2n).A092904
Number of decimal digits in the denominator of the Bernoulli number B(2n).
- Triangle, read by rows, such that the partial sums of the n-th row form the n-th diagonal, for n>=0, where each row begins with 1.A092905
Triangle, read by rows, such that the partial sums of the n-th row form the n-th diagonal, for n>=0, where each row begins with 1.
- Number of iterations of the sine function to be less than 1/n with an initial argument of Pi/2 radians.A092906
Number of iterations of the sine function to be less than 1/n with an initial argument of Pi/2 radians.
- Duplicate of A051022.A092907
Duplicate of A051022.
- Primes in A051022.A092908
Primes in A051022.
- Interpolate 0's between each pair of digits of n-th prime.A092909
Interpolate 0's between each pair of digits of n-th prime.
- a(n) is the (3n+2)-th component of the continued fraction for sum(k>=0,2^(-k!)).A092910
a(n) is the (3n+2)-th component of the continued fraction for sum(k>=0,2^(-k!)).