Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100530
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100530 a(n) = a(n-1)+Mod[n,4]+1; a(0)=0 +0
1
0, 2, 5, 9, 10, 12, 15, 19, 20, 22, 25, 29, 30, 32, 35, 39, 40, 42, 45, 49, 50, 52, 55, 59, 60, 62, 65, 69, 70, 72, 75, 79, 80, 82, 85, 89, 90, 92, 95, 99, 100, 102, 105, 109, 110, 112, 115, 119, 120, 122, 125, 129, 130, 132, 135, 139, 140, 142, 145, 149, 150, 152, 155 (list; graph; listen)
OFFSET

0,2

COMMENT

Numbers == 0,2,5,9 modulo 10. - Ralf Stephan, May 15 2007

MATHEMATICA

digits=200 f[n_]:=f[n]=f[n-1]+Mod[n, 4]+1 f[0]=0; a=Table[f[n], {n, 1, digits}]

CROSSREFS

Sequence in context: A125969 A070240 A007369 this_sequence A155469 A055394 A078360

Adjacent sequences: A100527 A100528 A100529 this_sequence A100531 A100532 A100533

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Nov 24 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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research