Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110460
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110460 Least multiple of n such that every concatenation is a perfect square. +0
1
1, 6, 9, 744, 4179600, 8448511339584, 5768007101259200000000000049, 5174534068654382362457957919012519218990703784333328400, 27388066788668189787788892627720309836782181587536497095617493188146843279866975\ 92167893627634348717226004356 (list; graph; listen)
OFFSET

1,2

EXAMPLE

1,16,169,1695204 are all squares.

PROGRAM

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: A156180 A053490 A061110 this_sequence A159190 A004075 A052193

Adjacent sequences: A110457 A110458 A110459 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research