login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145594 A145593(n) mod 9. 0
8, 3, 4, 2, 6, 7, 5, 0, 1, 8, 3, 4, 2, 6, 7, 5, 0, 1, 8, 3, 4, 2, 6, 7, 5, 0, 1, 8, 3, 4, 2, 6, 7, 5, 0, 1, 8, 3, 4, 2, 6, 7, 5, 0, 1 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

Could be interpreted as the decimal expansion of the constant 92696389/111111111. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 24 2008

FORMULA

Period 9: a(n+9)=a(n).

a(n)=(1/3)*{-2*(n mod 9)+2*[(n+2) mod 9]+[(n+3) mod 9]-[(n+5) mod 9]+[(n+6) mod 9]+2*[(n+8) mod 9]}, with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Oct 20 2008]

CROSSREFS

Sequence in context: A181180 A117889 A021927 * A194731 A021849 A201754

Adjacent sequences:  A145591 A145592 A145593 * A145595 A145596 A145597

KEYWORD

nonn,less

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Oct 14 2008

EXTENSIONS

Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 24 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 16:39 EST 2012. Contains 205823 sequences.