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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068617 Starting from a(1)=8, each subsequent term is the minimal square obtained by inserting at least one digit in the previous term. 0
 8, 81, 841, 38416, 3841600, 384160000, 38416000000, 3841600000000, 384160000000000, 38416000000000000, 3841600000000000000, 384160000000000000000, 38416000000000000000000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The growing square sequence for 1 and 6, 2 and 5, 4 and 9 in pairs are the same. LINKS Table of n, a(n) for n=1..13. Index entries for linear recurrences with constant coefficients, signature (100). FORMULA For n>=4, a(n) = 38416*100^(n-4). From Chai Wah Wu, Aug 03 2020: (Start) a(n) = 100*a(n-1) for n > 4. G.f.: x*(45684*x^3 + 7259*x^2 + 719*x - 8)/(100*x - 1). (End) EXAMPLE a(2)=81 hence a(3) = 841 the smallest square formed from 81. CROSSREFS Cf. A068175, A068176, A068177, A068178, A068616. Sequence in context: A098308 A055996 A324016 * A207994 A210127 A007778 Adjacent sequences: A068614 A068615 A068616 * A068618 A068619 A068620 KEYWORD base,nonn AUTHOR Amarnath Murthy, Feb 25 2002 EXTENSIONS More terms from Sean A. Irvine, Sep 24 2009 Edited and extended by Max Alekseyev, Oct 12 2009 STATUS approved

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.

Last modified February 24 14:26 EST 2024. Contains 370305 sequences. (Running on oeis4.)