Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A034939
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A034939 a(n) is smallest number such that a(n)^2 + 1 is divisible by 5^n. +0
4
0, 2, 7, 57, 182, 1068, 1068, 32318, 110443, 280182, 3626068, 23157318, 120813568, 123327057, 1097376068, 11109655182, 49925501068, 355101282318, 355101282318, 3459595983307, 15613890344818, 110981321985443 (list; graph; listen)
OFFSET

0,2

PROGRAM

(PARI) b(n)=if(n<2, 2, b(n-1)^5)%5^n; a(n)=min(b(n), 5^n-b(n))

CROSSREFS

A034939(n)=min(A048898(n), A048899(n)). Cf. A034935.

Sequence in context: A024027 A079410 A002658 this_sequence A048898 A034935 A121079

Adjacent sequences: A034936 A034937 A034938 this_sequence A034940 A034941 A034942

KEYWORD

nonn,nice,easy

AUTHOR

njas

EXTENSIONS

More terms from Michael Somos

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 July 25 02:12 EDT 2008. Contains 142294 sequences.


AT&T Labs Research