Sequences
392,541 sequences
- Hilbert's Hamiltonian walk on N X N projected onto the first diagonal: M(3) (sum of the sequences A059252 and A059253).A059261
Hilbert's Hamiltonian walk on N X N projected onto the first diagonal: M(3) (sum of the sequences A059252 and A059253).
- Primes p such that x^9 = 2 has no solution mod p.A059262
Primes p such that x^9 = 2 has no solution mod p.
- Primes p such that x^10 = 2 has no solution mod p.A059263
Primes p such that x^10 = 2 has no solution mod p.
- Primes p such that x^12 = 2 has no solution mod p.A059264
Primes p such that x^12 = 2 has no solution mod p.
- Primes p such that x^14 = 2 has no solution mod p.A059265
Primes p such that x^14 = 2 has no solution mod p.
- Numbers k such that 4^k - 3 is prime.A059266
Numbers k such that 4^k - 3 is prime.
- Numbers n with 2 divisors d1 and d2 having difference 2: d2 - d1 = 2; equivalently, numbers that are 0 (mod 4) or have a divisor d of the form d = m^2 - 1.A059267
Numbers n with 2 divisors d1 and d2 having difference 2: d2 - d1 = 2; equivalently, numbers that are 0 (mod 4) or have a divisor d of the form d = m^2 - 1.
- Concatenate subsequences [2^0, 2^1, ..., 2^n] for n = 0, 1, 2, ...A059268
Concatenate subsequences [2^0, 2^1, ..., 2^n] for n = 0, 1, 2, ...
- Numbers m for which the number of divisors, tau(m), is divisible by 3.A059269
Numbers m for which the number of divisors, tau(m), is divisible by 3.
- a(n) is both the sum of n+1 consecutive integers and the sum of the n immediately higher consecutive integers.A059270
a(n) is both the sum of n+1 consecutive integers and the sum of the n immediately higher consecutive integers.
- Transform of A059226 applied to sequence 0, 1, 0, 0, 0, 0, ...A059271
Transform of A059226 applied to sequence 0, 1, 0, 0, 0, 0, ...
- G.f. is g.f. for A059271 divided by g.f. for A059227.A059272
G.f. is g.f. for A059271 divided by g.f. for A059227.
- Transform of A059226 applied to sequence 0, 0, 1, 0, 0, 0, 0, ...A059273
Transform of A059226 applied to sequence 0, 0, 1, 0, 0, 0, 0, ...
- Analog of A059226 in which left diagonal is all 1's.A059274
Analog of A059226 in which left diagonal is all 1's.
- Transform of A059226 applied to sequence 1, 1, 1, 1, 1, 1, 1, ...A059275
Transform of A059226 applied to sequence 1, 1, 1, 1, 1, 1, 1, ...
- Row sums of triangle in A059274.A059276
Row sums of triangle in A059274.
- 1^36, 2^25, 3^16, 4^9, 5^4, 6^1, 7^0.A059277
1^36, 2^25, 3^16, 4^9, 5^4, 6^1, 7^0.
- G.f. is G(x*(1-x)/(1-2*x)) where G(x) is g.f. for Catalan numbers A000108.A059278
G.f. is G(x*(1-x)/(1-2*x)) where G(x) is g.f. for Catalan numbers A000108.
- G.f. is ((1-x)/(1-2*x)) * G(x*(1-x)/(1-2*x)) where G(x) is g.f. for Catalan numbers A000108.A059279
G.f. is ((1-x)/(1-2*x)) * G(x*(1-x)/(1-2*x)) where G(x) is g.f. for Catalan numbers A000108.
- Expansion of e.g.f. exp(x*(1-x)/(1-2*x)).A059280
Expansion of e.g.f. exp(x*(1-x)/(1-2*x)).
- E.g.f.: ((1-x)/(1-2*x)) * exp(x*(1-x)/(1-2*x)).A059281
E.g.f.: ((1-x)/(1-2*x)) * exp(x*(1-x)/(1-2*x)).
- Number of symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census).A059282
Number of symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census).
- Triangle T(n,k) (0<= k <=n) read by rows. Left edge is 1, 0, 0, ... Otherwise each entry is sum of entry to left, entries immediately above it to left and right and entry directly above it 2 rows back.A059283
Triangle T(n,k) (0<= k <=n) read by rows. Left edge is 1, 0, 0, ... Otherwise each entry is sum of entry to left, entries immediately above it to left and right and entry directly above it 2 rows back.
- Right edge of triangle in A059283.A059284
Right edge of triangle in A059283.
- Hilbert's Hamiltonian walk projected onto the second diagonal: M'(3) (difference between sequences A059253 and A059252; their sum is A059261).A059285
Hilbert's Hamiltonian walk projected onto the second diagonal: M'(3) (difference between sequences A059253 and A059252; their sum is A059261).
- Triangle T(n,k) (0 <= k <= n) with e.g.f. exp(x*y/(1-y)).A059286
Triangle T(n,k) (0 <= k <= n) with e.g.f. exp(x*y/(1-y)).
- Primes p such that x^16 = 2 has no solution mod p, but x^8 = 2 has a solution mod p.A059287
Primes p such that x^16 = 2 has no solution mod p, but x^8 = 2 has a solution mod p.
- a(n) = binomial(2*n,n) mod n.A059288
a(n) = binomial(2*n,n) mod n.
- a(n) = 1 + (binomial(2n,n) mod n).A059289
a(n) = 1 + (binomial(2n,n) mod n).
- a(n) = round(1/144*n^2*(n + 3)).A059290
a(n) = round(1/144*n^2*(n + 3)).
- a(n) = round((n-1)^2*(n+5)/144).A059291
a(n) = round((n-1)^2*(n+5)/144).
- a(n) = n + 2 - (number of divisors of n).A059292
a(n) = n + 2 - (number of divisors of n).
- a(n) = round(n*(5*n - 14)/12) + 1.A059293
a(n) = round(n*(5*n - 14)/12) + 1.
- 2-boustrophedon transform applied to 1, 0, 0, 0, ...A059294
2-boustrophedon transform applied to 1, 0, 0, 0, ...
- 2-boustrophedon transform (see A059294) of 1, 1, 1, 1, ...A059295
2-boustrophedon transform (see A059294) of 1, 1, 1, 1, ...
- 2-boustrophedon transform (see A059294) of 0, 1, 0, 0, 0, ...A059296
2-boustrophedon transform (see A059294) of 0, 1, 0, 0, 0, ...
- Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 1.A059297
Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 1.
- Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 2.A059298
Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 2.
- Triangle of idempotent numbers (version 3), T(n, k) = binomial(n, k) * (n - k)^k.A059299
Triangle of idempotent numbers (version 3), T(n, k) = binomial(n, k) * (n - k)^k.
- Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 4.A059300
Triangle of idempotent numbers binomial(n,k)*k^(n-k), version 4.
- Number of filter bases of an n-set.A059301
Number of filter bases of an n-set.
- A diagonal of A008296.A059302
A diagonal of A008296.
- Numbers k such that floor(e^k) + 1 is prime.A059303
Numbers k such that floor(e^k) + 1 is prime.
- a(n) = 2^n * (2*n)! / (n!)^2.A059304
a(n) = 2^n * (2*n)! / (n!)^2.
- a(n) = pi(Mersenne(n)): index of n-th Mersenne prime.A059305
a(n) = pi(Mersenne(n)): index of n-th Mersenne prime.
- Number of 2 X 2 singular integer matrices with elements from {0,...,n}.A059306
Number of 2 X 2 singular integer matrices with elements from {0,...,n}.
- Numbers n such that base 10 representation of n does not contain a block of digits which is a square: blocks like 0, 1, 4, 9, 36, 121, ... are forbidden.A059307
Numbers n such that base 10 representation of n does not contain a block of digits which is a square: blocks like 0, 1, 4, 9, 36, 121, ... are forbidden.
- Primes p such that x^15 = 2 has no solution mod p.A059308
Primes p such that x^15 = 2 has no solution mod p.
- Primes p such that x^20 = 2 has no solution mod p.A059309
Primes p such that x^20 = 2 has no solution mod p.
- Primes p such that x^21 = 2 has no solution mod p.A059310
Primes p such that x^21 = 2 has no solution mod p.