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!)
A246560 Least number k such that k concatenated with n is a square, or 0 if no such k exists. 0
8, 0, 0, 6, 2, 1, 0, 0, 4, 0, 0, 0, 0, 0, 0, 21, 0, 0, 0, 0, 1, 0, 0, 3, 2, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0, 0, 4, 0, 0, 1, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 3, 0, 0, 17, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 16, 0, 0, 4, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 8, 0, 0, 0, 23 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(n) = 0 if and only if n is in A246448.

LINKS

Table of n, a(n) for n=1..104.

EXAMPLE

The smallest square ending with 5 is 25, so a(5) = 2.

PROG

(PARI)

b(n)=v=[]; for(k=10^(n-1), 10^n, v=concat(v, k^2%10^n)); v=vecsort(v, , 8); v

w=[]; for(k=1, 250, d=digits(k); if(vecsearch(b(#d), k), w=concat(w, k))); w=vecsort(w, , 8); w;

a(n)=if(!vecsearch(w, n), return(0)); if(vecsearch(w, n), j=1; s=Str(n); while(!issquare(eval(concat(Str(j), s))), j++); return(j))

vector(200, n, a(n))

CROSSREFS

Cf. A000290, A071176, A246448.

Sequence in context: A157244 A154191 A010771 * A199064 A280653 A274413

Adjacent sequences:  A246557 A246558 A246559 * A246561 A246562 A246563

KEYWORD

nonn,base

AUTHOR

Derek Orr, Aug 29 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 10 15:09 EST 2019. Contains 329896 sequences. (Running on oeis4.)