Sequences

Begins with (2, 5); avoids 3-term arithmetic progressions.

Begins with (3, 4); avoids 3-term arithmetic progressions.

Begins with (3, 5) and avoids 3-term arithmetic progressions.

Begins with (4, 5); avoids 3-term arithmetic progressions.

First occurrence of n as a term in the continued fraction for zeta(3).

Incrementally largest terms in the continued fraction for zeta(3).

Positions of the incrementally largest terms in the continued fraction expansion of zeta(3), offset 1 variant.

Longest arithmetic progression of primes with difference 210 and minimal initial term.

Erroneous version of A002464.

Positive numbers having the same set of digits in base 6 and base 7.

Number of days in n years (n=4 is the first leap year).

Number of days in n years (n=3 is the first leap year).

Number of days in n years (n=2 is the first leap year).

Number of days in n years (n=1 is the first leap year).

n 3's followed by 1.

Threes and ones.

Number of distinct distances between n electrons in minimal energy configuration on a sphere.

Number of multisets of n positive integers with equal sum and product.

Numbers k such that exactly one multiset of k positive integers has equal sum and product.

Numbers k such that k! contains k as a string of digits.

Absolute Euler pseudoprimes: odd composite numbers n such that a^((n-1)/2) == +-1 (mod n) for every a coprime to n.

Number of pairs (p,q) such that 5*p + 6*q = n.

a(n) = number of pairs (p,q) such that 4*p + 9*q = n.

Catalan triangle A009766 transposed.

Rooted tree triangle read by rows: a(n,k) = number of forests with n nodes and k rooted trees.

Remove all 2's from decimal expansion of Pi, then all 3's, ..., then all 11's, ... (running through primes in order) with the restriction that only digits contiguous in the original expansion are removed.

a(n) = (n!)!/n!.

Minimal difference of any increasing arithmetic progression of n primes.

Smallest first term of arithmetic progression of n primes with difference A033188(n).

a(n) = Sum_{k=0..n} binomial(n,k) * binomial(Fibonacci(k)+1,2).

Binomial transform of [ 1, 0, 1, 1, 3, 6, 15, 36, 91, 231, 595, ... ], which is essentially binomial(Fibonacci(k) + 1, 2).

a(n) = binomial(Fibonacci(n) + 1, 2).

Binomial transform of A033192.

Cycle class sequence c(2n) (the number of true cycles of length 2n in which a certain node is included) for zeolite GOO (Goosecreekite) starting with a T2 atom.

Erroneous version of A133675.

a(n) = n^3 * Product_{p|n, p prime} (1 + 1/p).

Discriminants of quadratic number fields Q(sqrt -n) for n squarefree.

Discriminants of real quadratic number fields.

Primes of form x^2+6*y^2.

Primes congruent to {1, 3} (mod 8); or, odd primes of form x^2 + 2*y^2.

Primes of the form x^2 + 10*y^2.

Primes of form x^2+93*y^2.

Primes p congruent to {1, 2, 3} (mod 8); or primes p of form x^2 + 2*y^2; or primes p such that x^2 = -2 has a solution mod p.

Primes of form x^2 + 94*y^2.

Primes of form x^2 + 5*y^2.

Primes of form x^2+95*y^2.

Primes of the form x^2 + 7*y^2.

Primes of form x^2+97*y^2.

Primes of form x^2 + 11*y^2.

Primes of the form x^2+13*y^2.