Sequences

a(n+1) (n >= 1) is smallest number > a(n) which is the sum of cubes of distinct earlier terms.

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

Erroneous version of A307102.

a(n) = (n!)^3 + 1.

a(n) = 1 + 0!*1!*2!*...*n!.

Delete all 2's, 3's, 5's and 7's from the sequence of nonnegative integers.

Erroneous version of A031976.

Smarandache-Wellin numbers: a(n) is the concatenation of first n primes (written in base 10).

Concatenate odd numbers.

a(n) is the concatenation of the first n positive even numbers.

Concatenate squares.

Concatenate cubes.

Concatenation of Fibonacci(1) through Fibonacci(n).

Duplicate terms of A007908.

Poincaré series [or Poincare series] for depths of roots in a certain root system.

Poincaré series [or Poincare series] for depths of roots in a certain root system.

Poincaré series [or Poincare series] for depths of roots in a certain root system.

Poincaré series [or Poincare series] for depths of roots in a certain root system.

Sum of a(n) terms of 1/sqrt(k) first strictly exceeds n.

Smallest number m such that m^m is divisible by n.

Let I_c(n,d) be maximal number of independent sets in d-regular simple connected graphs with n vertices; sequence gives I_c(2n,3).

Numbers k such that Fibonacci(k) divides k!.

Let I_c(n,d) be the maximal number of independent sets in d-regular simple connected graphs with n vertices; sequence gives I_c(n,4).

Let I_c(n,d) be the maximal number of independent sets in d-regular simple connected graphs with n nodes; sequence gives I_c(2n,5).

Let I_c(n,d) be the maximal number of independent sets in d-regular simple connected graphs with n nodes; sequence gives I_c(n,6).

Number of length n necklaces with integer entries that cover an initial interval of positive integers.

Number of special orbits for dihedral group of degree n.

Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).

Number of steps from one unit vector to next in linear quantum cellular automata.

Number of steps from one unit vector to next in linear quantum cellular automata.

Number of steps from one unit vector to next in linear quantum cellular automata.

Number of steps from one unit vector to next in linear quantum cellular automata.

Number of steps from one unit vector to next in linear quantum cellular automata.

Squares whose digits are squares.

Cubes whose digits are cubes.

Primes whose digits are primes; primes having only {2, 3, 5, 7} as digits.

Squares which are a decimal concatenation of two or more squares.

Cubes formed by concatenating other cubes.

Primes formed by concatenating other primes.

a(n) is the concatenation of n and 2n.

a(n) is the concatenation of n and 3n.

a(n) is the concatenation of n and 4n.

a(n) is the concatenation of n and 5n.

Smallest number whose square is divisible by n.

Smallest number whose cube is divisible by n.

Dimension of space of Jacobi forms of weight 4 and index n.

Coordination sequence for G_2 lattice.

Coordination sequence for F_4 lattice.

Period 5: repeat [4, 4, 6, 6, 6].

Coordination sequence for C_4 lattice.