The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A048345 a(n)^2 is the smallest square containing exactly n 0's. 1
 0, 10, 320, 100, 3200, 1000, 32000, 10000, 320000, 100000, 3200000, 1000000, 32000000, 10000000, 320000000, 100000000, 3200000000, 1000000000, 32000000000, 10000000000, 320000000000, 100000000000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Eric Weisstein's World of Mathematics, Square Number Index entries for linear recurrences with constant coefficients, signature (0,10). FORMULA From Ralf Stephan, Jul 18 2013: (Start) a(n) = 10*a(n-2); a(0)=0, a(1)=10, a(2)=320. G.f.: (10*x + 320*x^2)/(1-10*x^2). (End) PROG (MAGMA) a:=[0, 10, 320]; [n le 3 select a[n] else 10*Self(n-2):n in [1..25]]; // Marius A. Burtea, Oct 11 2019 CROSSREFS Cf. A000290, A036507. Sequence in context: A291561 A302933 A180584 * A325726 A223298 A164055 Adjacent sequences:  A048342 A048343 A048344 * A048346 A048347 A048348 KEYWORD nonn,base,easy AUTHOR Patrick De Geest, Mar 15 1999 EXTENSIONS More terms from Lior Manor, Jul 02 2001 a(20) corrected by Georg Fischer, Dec 07 2019 STATUS approved

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

Last modified January 17 09:46 EST 2021. Contains 340214 sequences. (Running on oeis4.)