Sequences
392,541 sequences
- Number of positive integers <= 2^n of form 3 x^2 + 3 y^2.A054161
Number of positive integers <= 2^n of form 3 x^2 + 3 y^2.
- Number of positive integers <= 2^n of form 3 x^2 + 5 y^2.A054162
Number of positive integers <= 2^n of form 3 x^2 + 5 y^2.
- Number of positive integers <= 2^n of form 3 x^2 + 6 y^2.A054163
Number of positive integers <= 2^n of form 3 x^2 + 6 y^2.
- Number of positive integers <= 2^n of form 3 x^2 + 7 y^2.A054164
Number of positive integers <= 2^n of form 3 x^2 + 7 y^2.
- Number of positive integers <= 2^n of form 3 x^2 + 8 y^2.A054165
Number of positive integers <= 2^n of form 3 x^2 + 8 y^2.
- Number of positive integers <= 2^n of form 3 x^2 + 9 y^2.A054166
Number of positive integers <= 2^n of form 3 x^2 + 9 y^2.
- Number of positive integers <= 2^n of form 3 x^2 + 10 y^2.A054167
Number of positive integers <= 2^n of form 3 x^2 + 10 y^2.
- Inverse Moebius transform of A000013 (starting at term 0).A054168
Inverse Moebius transform of A000013 (starting at term 0).
- Number of positive integers <= 2^n of form 4 x^2 + 5 y^2.A054169
Number of positive integers <= 2^n of form 4 x^2 + 5 y^2.
- Moebius transform of A000013 (starting at term 0).A054170
Moebius transform of A000013 (starting at term 0).
- Number of positive integers <= 2^n of form 4 x^2 + 7 y^2.A054171
Number of positive integers <= 2^n of form 4 x^2 + 7 y^2.
- Inverse Moebius transform of A000048 (starting at term 0).A054172
Inverse Moebius transform of A000048 (starting at term 0).
- Number of positive integers <= 2^n of form 4 x^2 + 9 y^2.A054173
Number of positive integers <= 2^n of form 4 x^2 + 9 y^2.
- Moebius transform of A000048 (starting at term 0).A054174
Moebius transform of A000048 (starting at term 0).
- Number of positive integers <= 2^n of form 5 x^2 + 5 y^2.A054175
Number of positive integers <= 2^n of form 5 x^2 + 5 y^2.
- Number of positive integers <= 2^n of form 5 x^2 + 6 y^2.A054176
Number of positive integers <= 2^n of form 5 x^2 + 6 y^2.
- Number of positive integers <= 2^n of form 5 x^2 + 7 y^2.A054177
Number of positive integers <= 2^n of form 5 x^2 + 7 y^2.
- Number of positive integers <= 2^n of form 5 x^2 + 8 y^2.A054178
Number of positive integers <= 2^n of form 5 x^2 + 8 y^2.
- Number of positive integers <= 2^n of form 5 x^2 + 9 y^2.A054179
Number of positive integers <= 2^n of form 5 x^2 + 9 y^2.
- Number of positive integers <= 2^n of form 5 x^2 + 10 y^2.A054180
Number of positive integers <= 2^n of form 5 x^2 + 10 y^2.
- Inverse Moebius transform of A000011 (starting at term 0).A054181
Inverse Moebius transform of A000011 (starting at term 0).
- Number of positive integers <= 2^n of form 6*x^2 + 7*y^2.A054182
Number of positive integers <= 2^n of form 6*x^2 + 7*y^2.
- Moebius transform of A000011 (starting at term 0).A054183
Moebius transform of A000011 (starting at term 0).
- Number of positive integers <= 2^n of form 6 x^2 + 9 y^2.A054184
Number of positive integers <= 2^n of form 6 x^2 + 9 y^2.
- Binomial transform of A000031.A054185
Binomial transform of A000031.
- Number of positive integers <= 2^n of form 7 x^2 + 7 y^2.A054186
Number of positive integers <= 2^n of form 7 x^2 + 7 y^2.
- Number of positive integers <= 2^n of form 7 x^2 + 8 y^2.A054187
Number of positive integers <= 2^n of form 7 x^2 + 8 y^2.
- Number of positive integers <= 2^n of form 7 x^2 + 9 y^2.A054188
Number of positive integers <= 2^n of form 7 x^2 + 9 y^2.
- Number of positive integers <= 2^n of form 7 x^2 + 10 y^2.A054189
Number of positive integers <= 2^n of form 7 x^2 + 10 y^2.
- Binomial transform of A001037.A054190
Binomial transform of A001037.
- Number of positive integers <= 2^n of form 8 x^2 + 9 y^2.A054191
Number of positive integers <= 2^n of form 8 x^2 + 9 y^2.
- Binomial transform of A000029.A054192
Binomial transform of A000029.
- Number of positive integers <= 2^n of form 9 x^2 + 9 y^2.A054193
Number of positive integers <= 2^n of form 9 x^2 + 9 y^2.
- Number of positive integers <= 2^n of form 9 x^2 + 10 y^2.A054194
Number of positive integers <= 2^n of form 9 x^2 + 10 y^2.
- Binomial transform of A001371.A054195
Binomial transform of A001371.
- Binomial transform of A000013.A054196
Binomial transform of A000013.
- Binomial transform of A000048.A054197
Binomial transform of A000048.
- Binomial transform of A000011.A054198
Binomial transform of A000011.
- Binomial transform of A000046 (1, 1, 1, 1, 2, 3, 5, 8, 14, 21, 39, 62, 112, ...).A054199
Binomial transform of A000046 (1, 1, 1, 1, 2, 3, 5, 8, 14, 21, 39, 62, 112, ...).
- Number of binary vectors (x_1,...x_n) satisfying Sum_{i=1..n} i*x_i = 3 (mod n+1) = size of Varshamov-Tenengolts code VT_3(n).A054200
Number of binary vectors (x_1,...x_n) satisfying Sum_{i=1..n} i*x_i = 3 (mod n+1) = size of Varshamov-Tenengolts code VT_3(n).
- a(n) = (n-1)! * Sum_{k=1..n} k^k/k!.A054201
a(n) = (n-1)! * Sum_{k=1..n} k^k/k!.
- a(n) = (n-1)! * Sum_{k=1..n} floor(k^k/k!).A054202
a(n) = (n-1)! * Sum_{k=1..n} floor(k^k/k!).
- a(n) is the smallest start of a run of exactly n+1 consecutive primes with n (not necessarily equal) prime differences, each divisible by 6.A054203
a(n) is the smallest start of a run of exactly n+1 consecutive primes with n (not necessarily equal) prime differences, each divisible by 6.
- Integers expressible as sums of distinct even-subscripted Fibonacci numbers.A054204
Integers expressible as sums of distinct even-subscripted Fibonacci numbers.
- Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3) = j^3 + k^3, ordered by increasing i; sequence gives i values.A054205
Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3) = j^3 + k^3, ordered by increasing i; sequence gives i values.
- Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3)=j^3+k^3, ordered by increasing i; sequence gives j values.A054206
Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3)=j^3+k^3, ordered by increasing i; sequence gives j values.
- Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3)=j^3+k^3, ordered by increasing i; sequence gives k values.A054207
Consider all integer triples (i,j,k), j >= k > 0, with binomial(i+2,3)=j^3+k^3, ordered by increasing i; sequence gives k values.
- Consider all integer triples (i,j,k), j >= k > 0, with i^3 = binomial(j+2,3) + binomial(k+2,3), ordered by increasing i; sequence gives i values.A054208
Consider all integer triples (i,j,k), j >= k > 0, with i^3 = binomial(j+2,3) + binomial(k+2,3), ordered by increasing i; sequence gives i values.
- Consider all integer triples (i,j,k), j >= k>0, with i^3=binomial(j+2,3)+binomial(k+2,3), ordered by increasing i; sequence gives j values.A054209
Consider all integer triples (i,j,k), j >= k>0, with i^3=binomial(j+2,3)+binomial(k+2,3), ordered by increasing i; sequence gives j values.
- Consider all integer triples (i,j,k), j >= k>0, with i^3=binomial(j+2,3)+binomial(k+2,3), ordered by increasing i; sequence gives k values.A054210
Consider all integer triples (i,j,k), j >= k>0, with i^3=binomial(j+2,3)+binomial(k+2,3), ordered by increasing i; sequence gives k values.