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!)
A061359 a(1) = 1; a(n) = least number such that the concatenation a(n)a(n-1)...a(2)a(1) is a square. 14

%I #8 Feb 11 2023 20:32:45

%S 1,8,16,146,22086,31071113326,365107058344463715696,

%T 2684967738644586785227227090233956040549004,

%U 809079884187716191997158821357206898310718837487307207657194711477350102495950972665

%N a(1) = 1; a(n) = least number such that the concatenation a(n)a(n-1)...a(2)a(1) is a square.

%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a061/A061359.java">Java program</a> (github)

%e a(3)a(2)a(1) = 1681 = 41^2, a(4)a(3)a(2)a(1) = 1461681 = 1209^2.

%Y Cf. A050634, A050635.

%K nonn,base

%O 1,2

%A _Amarnath Murthy_, Apr 28 2001

%E Corrected and extended by Larry Reeves (larryr(AT)acm.org), May 07 2001

%E More terms from Ulrich Schimke (ulrschimke(AT)aol.com), Nov 06 2001

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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)