login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185041 a(n) = number of partitions of 10^n mod 10 0

%I #9 Apr 06 2016 19:57:44

%S 1,2,2,1,4,9,8,0,2,9,9,5,6,5,7,2,1,6,9,6

%N a(n) = number of partitions of 10^n mod 10

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

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

%t Table[Mod[PartitionsP[10^n], 10], {n, 0, 6}]

%o (PARI) a(n)=numbpart(10^n)%10 \\ _Charles R Greathouse IV_, Apr 06 2016

%Y Equals A070177(n) mod 10

%K nonn

%O 0,2

%A _Fredrik Johansson_, Jan 23 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 08:59 EDT 2024. Contains 371935 sequences. (Running on oeis4.)