|
Search: id:A069500
|
|
|
| A069500 |
|
a(1) = 1; a(n) = smallest multiple of a(n-1) which is a palindromic square. |
|
+0
1
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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 (wasserma(AT)spawar.navy.mil), Apr 17 2003.
|
|
CROSSREFS
|
Sequence in context: A058442 A075411 A114763 this_sequence A053953 A024058 A022919
Adjacent sequences: A069497 A069498 A069499 this_sequence A069501 A069502 A069503
|
|
KEYWORD
|
base,nonn,hard
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 30 2002
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Apr 17 2003
|
|
|
Search completed in 0.002 seconds
|
