OEIS contributions


 

A000045 - Fibonacci numbers: F(n) = F(n-1) + F(n-2) with F(0) = 0 and F(1) = 1.

A003418 - Least common multiple (or LCM) of {1, 2, ..., n} for n >= 1, a(0) = 1.

A005846 - Primes of form n^2 + n + 41.

A006862 - Euclid numbers: 1 + product of the first n primes.

A020914 - Number of digits in base 2 representation of 3^n.

A051451 - LCM{ 1,2,...,x } where x is a prime power (A000961).

A066951 - Number of nonisomorphic connected graphs that can be drawn in the plane using n unit-length edges.

A076227 - Number of surviving Collatz residues mod 2^n.

A098294 - Smallest exponent of 2 which gives a power of 2 which is equal or bigger than (3/2)^n, n = 0,1,... .

A100982 - Number of admissible sequences of order j; related to 3x+1 problem and Wagon's constant.

A144611 - Sturmian word of slope sqrt(2).

A155557 - A proximate-prime polynomial sequence generated by 2n^2 - 2n + 53089.

A177789 - Irregular triangle in which row n gives the congruences (mod 2^A020914(n)) satisfied by the numbers having dropping time A122437(n+1) in the Collatz (3x+1) iteration.

A293308 - Number of permutations of zero-one words with A056576(n)-n zeros and n-1 ones.