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.
%I A185041 #11 Jun 02 2025 03:54:14
%S A185041 1,2,2,1,4,9,8,0,2,9,9,5,6,5,7,2,1,6,9,6
%N A185041 a(n) = number of partitions of 10^n mod 10.
%C A185041 p(10^n) mod 10 where p(n) = A000041(n)
%e A185041 p(10^2) = 190569292, so a(2) = 2
%t A185041 Table[Mod[PartitionsP[10^n], 10], {n, 0, 6}]
%o A185041 (PARI) a(n)=numbpart(10^n)%10 \\ _Charles R Greathouse IV_, Apr 06 2016
%Y A185041 Equals A070177(n) mod 10
%K A185041 nonn
%O A185041 0,2
%A A185041 _Fredrik Johansson_, Jan 23 2012