Sequences

a(n) = n*(n+1)*(4*n+5)/6.

Write down decimal expansion of Pi; divide up into chunks of minimal length so that chunks are increasing numbers and do not begin with 0.

Inverse of 2054th cyclotomic polynomial.

Smallest side lengths of almost-equilateral Heronian triangles (sides are consecutive positive integers, area is a nonnegative integer).

a(n) = Sum_{k=0..n} k!*(k+1)!.

a(n) = round(e^(e^n)).

Consider all ways of writing a number as p+2m^2 where p is 1 or a prime and m >= 0; sequence gives numbers that are expressible in at least 2 more ways than any smaller number.

Inverse of 2059th cyclotomic polynomial.

Numbers k such that k^2 contains exactly 2 distinct digits.

Numbers k such that k^2 contains exactly 2 different digits, excluding 10^m, 2*10^m, 3*10^m.

Successive pattern lengths of a conjectured Busy Beaver by Uwe Schult.

Obsolete sequence of lower bounds for A028444.

Undulating squares.

Inverse of 2065th cyclotomic polynomial.

Expansion of 1/((1-8*x)*(1-9*x)*(1-10*x)*(1-11*x)).

Inverse of 2067th cyclotomic polynomial.

Inverse of 2068th cyclotomic polynomial.

Smallest number that is sum of 2 positive n-th powers in 2 different ways.

Inverse of 2070th cyclotomic polynomial.

Inverse of 2071st cyclotomic polynomial.

Add 4, then reverse digits; start with 3.

Add 4, then reverse the decimal digits; start with 10.

Inverse of 2074th cyclotomic polynomial.

a(n+1) = a(n) + its digital root.

a(1) = 1; a(n+1) = floor((sum{k=1 to n} a(k)^3)^(1/3)).

Inverse of 2077th cyclotomic polynomial.

First nontrivial or multidigital Armstrong number to base n.

a(n) = smallest prime p such that Sum_{primes q = 2, ..., p} 1/q exceeds n.

Numbers n such that n divides n-th Lucas number A000032(n).

a(n) = 16^(5^n) mod 10^n: Automorphic numbers ending in digit 6, with repetitions.

Expansion of 1/((1-8x)(1-9x)(1-10x)(1-12x)).

Expansion of 1/((1-8*x)*(1-9*x)*(1-11*x)*(1-12*x)).

Expansion of 1/((1-8*x)*(1-10*x)*(1-11*x)*(1-12*x)).

Expansion of 1/((1-9*x)*(1-10*x)*(1-11*x)*(1-12*x)).

Triangular array T(n,k) read by rows, where T(n,k) = coefficient of x^n*y^k in 1/(1-x-y-(x+y)^2).

a(n+1) = a(n) + sum of its digits, with a(1) = 9.

Erroneous version of A063507.

Number of crossing set partitions of {1,2,...,n}.

Inverse of 2090th cyclotomic polynomial.

Inverse of 2091st cyclotomic polynomial.

(n! - n)/2 for even n.

Inverse of 2093rd cyclotomic polynomial.

Expansion of 1/((1-4x)(1-5x)(1-6x)).

2^2^2^ ... 2^w (with n 2's), where w = 1.92878... = A086238.

Blum integers: numbers of the form p * q where p and q are distinct primes congruent to 3 (mod 4).

Nonpalindromic and "non-core" numbers that when squared give palindrome with odd number of digits.

Bachet's equation: X^2 + k = Y^3, k=999. The terms are values of X, corresponding Y are in A248481.

Numbers k=3*m+1 such that 2^m == 1 (mod k).

Expansion of 1/((1-7*x)*(1-8*x)*(1-9*x)*(1-10*x)).

Inverse of 2101st cyclotomic polynomial.