Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Nov 17 2014 09:40:47
%S 8,81,81225,8122515625,812251562541751472569,
%T 812251562541751472569881528811450814530084
%N a(n+1) is next smallest square not divisible by 10 beginning with a(n), initial term is 8.
%H Hiroaki Yamanouchi, <a href="/A249898/b249898.txt">Table of n, a(n) for n = 1..10</a>
%o (PARI) a(n)=k=n; s=1; while(s<5*10^7, if(s%10, if(s^2\(10^(#Str(s^2)-#Str(k)))==k, print1(s^2, ", "); k=s^2)); s++)
%o a(8)
%o (Python)
%o def f(x):
%o ..print(x, end=', ')
%o ..n = x
%o ..s = 1
%o ..while s < 10**7:
%o ....if s % 10:
%o ......S = str(s**2)
%o ......if S.startswith(str(n)):
%o ........print(s**2, end=', ')
%o ........n = s**2
%o ....s += 1
%o f(8)
%Y Cf. A048559, A048561.
%K nonn,base
%O 1,1
%A _Derek Orr_, Nov 08 2014