Implementations of select OEIS integer sequences in Python 3.
- A000004: The zero sequence
- A000010: Euler phi of n
- A000012: The one sequence
- A000027: The positive integers
- A000035: Parity of n
- A000040: The primes
- A000043: Mersenne exponents
- A000045: Fibonacci numbers
- A000079: Powers of 2
- A000108: Catalan numbers
- A000290: Triangular numbers
- A000290: The squares
- A000330: Square pyramidal numbers
- A000668: Mersenne primes
- A001223: Prime gaps
- A001462: Golomb's sequence
- A002024: n appears n times
- A005408: The odd numbers
- A005843: The even numbers
- A006753: Smith numbers
- A006530: Greatest prime factor of n
- A007953: Digital sum of n
- A007954: Digital product of n
- A010051: Characteristic function of primes
- A001223: n is triangular
- A019506: Hoax numbers
- A063737: Digit sum of n equals the sum of its prime factors