Sequences

Numbers that contain odd digits only.

Inverse of 253rd cyclotomic polynomial.

Numbers that contain even digits only.

Inverse of 255th cyclotomic polynomial.

Number of trees on n nodes with forbidden limbs.

Number of trees on n nodes with forbidden limbs.

Number of rooted trees on n nodes with forbidden limbs.

Inverse of 259th cyclotomic polynomial.

Inverse of 260th cyclotomic polynomial.

Number of trees on n nodes with forbidden limbs.

Number of trees on n nodes with forbidden limbs.

Number of trees on n nodes with forbidden limbs.

Number of trees on n nodes with forbidden limbs.

Number of trees on n nodes with forbidden limbs.

Inverse of 266th cyclotomic polynomial.

Number of directed rooted trees on n nodes with forbidden limbs.

Erroneous version of A269484.

Number of trees on n nodes with 3 forbidden limbs of size 4, 5 and 6.

Number of trees on n nodes with forbidden limbs.

Number of trees on n nodes with 3 forbidden limbs of size 4, 5 and 6.

Number of trees on n nodes with forbidden limbs.

Inverse of 273rd cyclotomic polynomial.

a(n) = Fibonacci(n) - n^2.

Partial sums of primes, if 1 is regarded as a prime (as it was until quite recently, see A008578).

a(n) = Sum_{j=1..n} j*prime(j).

a(n) = Sum_{j=0..n} j*Fibonacci(j).

Value of the name of n as a Roman number, keeping only relevant letters, zero if none (v=u). French version.

a(n) = floor(Sum_{k=0..n} k!/2), or floor( A003422(n+1)/2 ).

Inverse of 280th cyclotomic polynomial.

Submitted to the OEIS as "Seen on a billboard in England, definition unknown".

Imaginary Rabbits: imaginary part of a(0)=i; a(1)=-i; a(n) = a(n-1) + i*a(n-2), with i = sqrt(-1).

a(n) = 2*a(n-1) - a(n-2) - a(n-4) with a(0) = a(1) = 0, a(2) = 1, a(3) = 2.

a(n) = n^(n+1) - n + 1.

Inverse of 285th cyclotomic polynomial.

Inverse of 286th cyclotomic polynomial.

Inverse of 287th cyclotomic polynomial.

a(n) = n! * C(n+2, 2) * 2^(n+1).

a(n) = 2^n * (3n)! / (2n+1)!.

Inverse of 290th cyclotomic polynomial.

Number of nodes of odd outdegree in all ordered rooted (planar) trees with n edges.

Number of internal nodes of even outdegree in all ordered rooted trees with n edges.

a(n) = prime(n)*(prime(n-1)-1)/2.

a(n) = prime(n)*(prime(n+1)-1)/2.

Expansion of e.g.f. 1/sqrt(exp(x)*(2-exp(x))).

Duplicate of A023533.

a(n) = 0 if n of form m(m+1)(m+2)/6, otherwise 1.

Expansion of the e.g.f. sqrt(exp(x) / (2 - exp(x))).

Inverse of 299th cyclotomic polynomial.

a(n) = (n+2)*(n+1)*(n^2 + 7*n - 12)/24.

Inverse of 301st cyclotomic polynomial.