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 A005706 M0519 #57 Apr 30 2018 10:53:11
%S A005706 1,2,3,4,5,7,9,11,13,15,18,21,24,27,30,34,38,42,46,50,55,60,65,70,75,
%T A005706 82,89,96,103,110,119,128,137,146,155,166,177,188,199,210,223,236,249,
%U A005706 262,275,290,305,320,335,350,368,386,404,422,440,461,482,503,524,545
%N A005706 Number of partitions of 5n into powers of 5.
%C A005706 Euler transform of [2,0,0,0,1,0,0,0,0,...] with 1's at 5^n. - _Michael Somos_, Mar 16 2004
%C A005706 Partial sums of number of partitions of n into powers of 5. - _Michael Somos_, Mar 16 2004
%D A005706 R. K. Guy, personal communication.
%D A005706 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A005706 Alois P. Heinz, <a href="/A005706/b005706.txt">Table of n, a(n) for n = 0..10000</a>
%H A005706 C. Banderier, H.-K. Hwang, V. Ravelomanana and V. Zacharovas, <a href="http://140.109.74.92/hk/wp-content/files/2012/07/mis-n-to-the-logn.pdf">Analysis of an exhaustive search algorithm in random graphs and the n^{c logn}-asymptotics</a>, preprint 2012; SIAM J. Discrete Math., 28(1), 342-371, 2014. - _N. J. A. Sloane_, Dec 23 2012
%H A005706 R. K. Guy, <a href="/A000123/a000123_1.pdf">Letters to N. J. A. Sloane and J. W. Moon, 1988</a>
%H A005706 M. D. Hirschhorn and J. A. Sellers, <a href="https://ajc.maths.uq.edu.au/pdf/30/ajc_v30_p193.pdf">A different view of m-ary partitions</a>, Australasian J. Combin., 30 (2004), 193-196.
%H A005706 M. D. Hirschhorn and J. A. Sellers, <a href="http://www.math.psu.edu/sellersj/mike-m-ary.pdf">A different view of m-ary partitions</a>
%H A005706 M. Latapy, <a href="https://hal.inria.fr/hal-01182959">Partitions of an integer into powers</a>, DMTCS Proceedings AA (DM-CCG), 2001, 215-228.
%H A005706 M. Latapy, <a href="/A005706/a005706.pdf">Partitions of an integer into powers</a>, DMTCS Proceedings AA (DM-CCG), 2001, 215-228. [Cached copy, with permission]
%H A005706 O. J. Rodseth and J. A. Sellers, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL8/Sellers/sellers75.html">On a Restricted m-Non-Squashing Partition Function</a>, Journal of Integer Sequences, Vol. 8 (2005), Article 05.5.4.
%F A005706 a(n) = a(n-1) + a([n/5]).
%F A005706 a(n) = [x^(5*n)] Product_{k>=0} 1/(1 - x^(5^k)). - _Ilya Gutkovskiy_, Jun 05 2017
%t A005706 a[0] = 1; a[n_] := a[n] = a[n - 1] + a[Floor[n/5]]; Table[a@ n, {n, 0, 60}] (* _Michael De Vlieger_, Mar 25 2016 *)
%o A005706 (PARI) a(n)=if(n<1,n==0,a(n-1)+a(n\5))
%Y A005706 Column k=5 of A292477.
%Y A005706 Cf. A000041, A000123, A005704, A005705.
%K A005706 nonn,easy
%O A005706 0,2
%A A005706 _N. J. A. Sloane_
%E A005706 Formula and more terms from _Henry Bottomley_, Apr 30 2001