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; internal format)
OFFSET

1,2

EXAMPLE

1,16,169,1695204 are all squares.

PROG

Contribution from David Wasserman (dwasserm(AT)earthlink.net), 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 (dwasserm(AT)earthlink.net), Dec 03 2008]

Sequence in context: A191011 A053490 A061110 * A159190 A004075 A202951

Adjacent sequences:  A110457 A110458 A110459 * A110461 A110462 A110463

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 04 2005

EXTENSIONS

More terms from David Wasserman (dwasserm(AT)earthlink.net), Dec 03 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 04:52 EST 2012. Contains 205985 sequences.