Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085877
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085877 Smallest square k^2 == 1 (mod 10^n) where k > 1. +0
2
81, 2401, 62001, 1560001, 351600001, 47852000001, 610350000001, 586547900000001, 5508423000000001, 2032852170000000001, 184259414700000000001, 26756525040000000000001, 26756525040000000000001 (list; graph; listen)
OFFSET

1,1

COMMENT

Sequence is infinite as (10^n + 1)^2 is a candidate, i.e. a(n) < = (10^n +1)^2.

CROSSREFS

Cf. A085878.

Sequence in context: A038676 A016840 A128832 this_sequence A123219 A018223 A038398

Adjacent sequences: A085874 A085875 A085876 this_sequence A085878 A085879 A085880

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 07 2003

EXTENSIONS

Corrected and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jul 09 2003

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research