The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A065298 a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) properly contained in the digits of a(n+1)^2, with a(0)=2. 5
2, 7, 43, 136, 367, 1157, 3658, 10183, 32193, 101407, 320537, 1001842, 3166463, 10001923, 31627114, 100017313, 316599084, 1000104687, 3162331407, 10000483663 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
a(n) for n>0 remains the same when a(0)=3.
LINKS
EXAMPLE
43^2 = 1849 and 136 is the next smallest number whose square (in this case 18496) properly contains the digits 1,4,8,9.
CROSSREFS
Sequence in context: A267239 A001174 A067975 * A091877 A050631 A235714
KEYWORD
base,nonn,more
AUTHOR
Floor van Lamoen, Oct 29 2001
EXTENSIONS
More terms from Marc Paulhus, Feb 04 2002
a(18)-a(19) from Sean A. Irvine, Aug 26 2023
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 22 17:00 EDT 2024. Contains 372758 sequences. (Running on oeis4.)