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

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

0,9

COMMENTS

Periodic with length 8^2=64.

FORMULA

a(n)=(1+floor(n/8)) mod 8.

a(n)=1+floor(n/8)-8*floor((n+8)/64).

a(n)=(((n+8) mod 64)-(n mod 8))/8.

a(n)=((n+8-(n mod 8))/8) mod 8.

G.f. g(x)=(1-x^8)(1+2x^8+3x^16+4x^24+5x^32+6x^40+7x^48)/((1-x)(1-x^64)).

G.f. g(x)=(1-x^8)*sum{0<=k<7, (k+1)*x^(8*k)}/((1-x)(1-x^64)).

G.f. g(x)=(7x^64-8x^56+1)/((1-x)(1-x^8)(1-x^64)).

MATHEMATICA

Flatten[Join[Table[PadRight[{}, 8, n], {n, 7}], Table[PadRight[{}, 8, n], {n, 0, 7}]]] (* From Harvey P. Dale, Nov 06 2011 *)

CROSSREFS

Cf. A000040, A133620-A133625, A133630, A038509, A133634-A133636.

Cf. A133888, A133880, A133890, A133900, A133910.

Sequence in context: A079416 A135664 A058318 * A132292 A110656 A104407

Adjacent sequences:  A133875 A133876 A133877 * A133879 A133880 A133881

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Oct 10 2007

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 14 01:35 EST 2012. Contains 205567 sequences.