%I A069500
%S A069500 1,4,484,69696
%N A069500 a(1) = 1; a(n) = smallest multiple of a(n-1) which is a palindromic square.
%C A069500 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.
%Y A069500 Sequence in context: A058442 A075411 A114763 this_sequence A053953 A024058 
               A022919
%Y A069500 Adjacent sequences: A069497 A069498 A069499 this_sequence A069501 A069502 
               A069503
%K A069500 base,nonn,hard
%O A069500 1,2
%A A069500 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 30 2002
%E A069500 More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Apr 17 
               2003