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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069500 a(1) = 1; a(n) = smallest multiple of a(n-1) which is a palindromic square. 0

%I

%S 1,4,484,69696

%N a(1) = 1; a(n) = smallest multiple of a(n-1) which is a palindromic square.

%C a(5) is greater than 10^23. A naive probabilistic argument suggests that each time the search limit is increased by two orders of magnitude, the chance of finding a(5) is about 1%. The probabilistic argument also suggests that this sequence grows about as fast as the polypowers with base exp(1/2). - _David Wasserman_, Apr 17 2003.

%K base,nonn,hard

%O 1,2

%A _Amarnath Murthy_, Mar 30 2002

%E More terms from _David Wasserman_, Apr 17 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 8 03:01 EDT 2020. Contains 333312 sequences. (Running on oeis4.)