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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110460 Least multiple of n such that every concatenation is a perfect square. 0
1, 6, 9, 744, 4179600, 8448511339584, 5768007101259200000000000049, 5174534068654382362457957919012519218990703784333328400, 2738806678866818978778889262772030983678218158753649709561749318814684327986697592167893627634348717226004356 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

EXAMPLE

1,16,169,169744 are all squares.

PROG

Contribution from David Wasserman, Dec 03 2008: (Start)

(PARI) f(n, num) = local(d, x); d = 1; while (1, x = sqrtint(num*10^d + 10^(d - 1) - 1) + 1; while (x^2 < (num + 1)*10^d && (x^2%10^d)%n, x++); if (x^2 < (num + 1)*10^d, return([x^2, x^2%10^d])); d++);

num = 0;

for (n = 1, 15, p = f(n, num); print(p[2]); num = p[1]); (End)

CROSSREFS

A061110 [From David Wasserman, Dec 03 2008]

Sequence in context: A265383 A264375 A061110 * A159190 A236766 A004075

Adjacent sequences:  A110457 A110458 A110459 * A110461 A110462 A110463

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Aug 04 2005

EXTENSIONS

More terms from David Wasserman, Dec 03 2008

Example corrected by Harvey P. Dale, Aug 06 2019

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 October 16 18:38 EDT 2019. Contains 328102 sequences. (Running on oeis4.)