Sequences
392,541 sequences
- Expansion of g.f. (1-4*x)/(1-8*x).A092811
Expansion of g.f. (1-4*x)/(1-8*x).
- Number of closed walks of length 2*n on the 4-cube.A092812
Number of closed walks of length 2*n on the 4-cube.
- Schmidt's problem sum for r = 3.A092813
Schmidt's problem sum for r = 3.
- Schmidt's problem sum for r = 4.A092814
Schmidt's problem sum for r = 4.
- Schmidt's problem sum for r = 5.A092815
Schmidt's problem sum for r = 5.
- Number of Sophie Germain primes less than 10^n.A092816
Number of Sophie Germain primes less than 10^n.
- First component 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.A092817
First component 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.
- Second component 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.A092818
Second component 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.
- Third component 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.A092819
Third component 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.
- a(0) = 1; for n>0, a(n) = 16 times sum of cubes of divisors of n.A092820
a(0) = 1; for n>0, a(n) = 16 times sum of cubes of divisors of n.
- Table read by rows: T(n,k)= z (z') or product of z with its complex conjugate, with z=Sum[binomial[n,t] I^t, {t,0,k}].A092821
Table read by rows: T(n,k)= z (z') or product of z with its complex conjugate, with z=Sum[binomial[n,t] I^t, {t,0,k}].
- Row sums of A092821.A092822
Row sums of A092821.
- Euler numbers whose absolute value is prime.A092823
Euler numbers whose absolute value is prime.
- Farey-factorial numerators.A092824
Farey-factorial numerators.
- Indices of prime Apéry numbers.A092825
Indices of prime Apéry numbers.
- Prime Apery numbers.A092826
Prime Apery numbers.
- From a quiz. The choices given for the next two terms are: i) 12,32; ii) 22,18; iii) 17,64; iv) 5,21; v) 13,19.A092827
From a quiz. The choices given for the next two terms are: i) 12,32; ii) 22,18; iii) 17,64; iv) 5,21; v) 13,19.
- Prime Apéry B-numbers.A092828
Prime Apéry B-numbers.
- a(n) is the solution of the equation A081943(x) =n (a(A081943(n)) =n).A092829
a(n) is the solution of the equation A081943(x) =n (a(A081943(n)) =n).
- Central Delannoy numbers that are primes.A092830
Central Delannoy numbers that are primes.
- Indices of prime Motzkin numbers.A092831
Indices of prime Motzkin numbers.
- Prime Motzkin numbers (see A001006).A092832
Prime Motzkin numbers (see A001006).
- Expansion of q / (chi(-q) * chi(-q^23)) in powers of q where chi() is a Ramanujan theta function.A092833
Expansion of q / (chi(-q) * chi(-q^23)) in powers of q where chi() is a Ramanujan theta function.
- Coefficients of a solution to a functional equation.A092834
Coefficients of a solution to a functional equation.
- Indices of prime tribonacci numbers, minus 1.A092835
Indices of prime tribonacci numbers, minus 1.
- Prime tribonacci numbers.A092836
Prime tribonacci numbers.
- Indices of terms in the series for sec(x) that have prime numerators.A092837
Indices of terms in the series for sec(x) that have prime numerators.
- Numerators in the series for sec(x) that are primes.A092838
Numerators in the series for sec(x) that are primes.
- Indices of primes in A001003.A092839
Indices of primes in A001003.
- Primes in A001003.A092840
Primes in A001003.
- Numerator of I(n) = Integral_{x=0..1/(4^n)} (1-sqrt(x))^2 dx; e.g., I(3) = 323/24576. The denominator is b(n) = 96*16^(n-1); e.g., b(3) = 24576.A092841
Numerator of I(n) = Integral_{x=0..1/(4^n)} (1-sqrt(x))^2 dx; e.g., I(3) = 323/24576. The denominator is b(n) = 96*16^(n-1); e.g., b(3) = 24576.
- a(n) is the solution of the equation A073666(x) = n (A073666(a(n)) = n).A092842
a(n) is the solution of the equation A073666(x) = n (A073666(a(n)) = n).
- a(n) = Sum_{k|n, k>1} phi(k-1), where phi() is the Euler phi function.A092843
a(n) = Sum_{k|n, k>1} phi(k-1), where phi() is the Euler phi function.
- a(n) = Sum_{k=1..n} prime(k)*10^(k-1).A092844
a(n) = Sum_{k=1..n} prime(k)*10^(k-1).
- A011545(n) reversed.A092845
A011545(n) reversed.
- a(n) = 100...001^n, where there are just enough zeros for the result to display the terms in the n-th row of Pascal's triangle.A092846
a(n) = 100...001^n, where there are just enough zeros for the result to display the terms in the n-th row of Pascal's triangle.
- a(n) = Sum_{k=1..n} round(prime(k) / log(prime(k))).A092847
a(n) = Sum_{k=1..n} round(prime(k) / log(prime(k))).
- Expansion of reciprocal of Hauptmodul for Gamma_0(18).A092848
Expansion of reciprocal of Hauptmodul for Gamma_0(18).
- Number of primes <= A092800(n).A092849
Number of primes <= A092800(n).
- Number of primes between A092800(n) and 10^n.A092850
Number of primes between A092800(n) and 10^n.
- Difference in count of primes <= mean and > mean below 10^n in A092849 and A092850.A092851
Difference in count of primes <= mean and > mean below 10^n in A092849 and A092850.
- Number of composites <= A092802(n).A092852
Number of composites <= A092802(n).
- Number of composites > mean composite (=A092802(n)) below 10^n.A092853
Number of composites > mean composite (=A092802(n)) below 10^n.
- Difference between number of composites > and <= mean (=A092802(n)) below 10^n.A092854
Difference between number of composites > and <= mean (=A092802(n)) below 10^n.
- Numbers k such that the k-th bit in the binary expansion of sqrt(2) - 1 is 1: sqrt(2) - 1 = Sum_{n>=1} 1/2^a(n).A092855
Numbers k such that the k-th bit in the binary expansion of sqrt(2) - 1 is 1: sqrt(2) - 1 = Sum_{n>=1} 1/2^a(n).
- Duplicate of A051006.A092856
Duplicate of A051006.
- Representation of 1/sqrt(2*Pi) by an infinite sequence.A092857
Representation of 1/sqrt(2*Pi) by an infinite sequence.
- "Sum" of the sequences of primes and the triangular numbers (A000217).A092858
"Sum" of the sequences of primes and the triangular numbers (A000217).
- "Difference" of the sequences of triangular numbers (A000217) and the primes (cf. A092858).A092859
"Difference" of the sequences of triangular numbers (A000217) and the primes (cf. A092858).
- "3 times the prime sequence".A092860
"3 times the prime sequence".