cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A185041 a(n) = number of partitions of 10^n mod 10.

Original entry on oeis.org

1, 2, 2, 1, 4, 9, 8, 0, 2, 9, 9, 5, 6, 5, 7, 2, 1, 6, 9, 6
Offset: 0

Views

Author

Fredrik Johansson, Jan 23 2012

Keywords

Comments

p(10^n) mod 10 where p(n) = A000041(n)

Examples

			p(10^2) = 190569292, so a(2) = 2
		

Crossrefs

Equals A070177(n) mod 10

Programs

  • Mathematica
    Table[Mod[PartitionsP[10^n], 10], {n, 0, 6}]
  • PARI
    a(n)=numbpart(10^n)%10 \\ Charles R Greathouse IV, Apr 06 2016