Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096973
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096973 a(1)= 10000, a(2)= 10000; for n>2, a(n)= ( a(n-2) + a(n-1) ) (mod 20000). +0
3
10000, 10000, 2, 10002, 10004, 6, 10010, 10016, 26, 10042, 10068, 110, 10178, 10288, 466, 10754, 11220, 1974 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Adjacent sequences: A096970 A096971 A096972 this_sequence A096974 A096975 A096976

Sequence in context: A084474 A033422 A033433 this_sequence A033829 A004268 A004269

KEYWORD

easy,nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Aug 19 2004

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 October 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research