login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100530 Numbers == 0,2,5,9 modulo 10. 0
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; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = a(n-1) + Mod[n,4] + 1; a(0)=0.
From Chai Wah Wu, Mar 07 2018: (Start)
a(n) = a(n-1) + a(n-4) - a(n-5) for n > 4.
G.f.: x*(x^3 + 4*x^2 + 3*x + 2)/(x^5 - x^4 - x + 1). (End)
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: A307213 A362398 A295567 * A155469 A055394 A078360
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Nov 24 2004
EXTENSIONS
Better name from Ralf Stephan, May 15 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:51 EDT 2024. Contains 371268 sequences. (Running on oeis4.)