login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A249894 a(n+1) is next smallest square not divisible by 10 beginning with a(n), initial term is 3. 5
3, 36, 361, 361201, 36120142809, 3612014280924268428225, 361201428092426842822525044572369542546150009 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Hiroaki Yamanouchi, Table of n, a(n) for n = 1..10

PROG

(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++)

a(3)

(Python)

def f(x):

..print(x, end=', ')

..n = x

..s = 1

..while s < 10**7:

....if s % 10:

......S = str(s**2)

......if S.startswith(str(n)):

........print(s**2, end=', ')

........n = s**2

....s += 1

f(3)

CROSSREFS

Cf. A048559, A048561.

Sequence in context: A055303 A274403 A068177 * A099670 A259131 A199258

Adjacent sequences:  A249891 A249892 A249893 * A249895 A249896 A249897

KEYWORD

nonn,base

AUTHOR

Derek Orr, Nov 08 2014

EXTENSIONS

a(7) corrected by Hiroaki Yamanouchi, Nov 17 2014

STATUS

approved

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 December 13 09:58 EST 2019. Contains 329968 sequences. (Running on oeis4.)