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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094451 a(n) = A033485(n) modulo 3. 0
1, 2, 0, 2, 1, 1, 1, 0, 2, 0, 1, 2, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 1, 2, 1, 0, 2, 1, 0, 2, 0, 1, 1, 1, 1, 1, 1, 1, 2, 0, 2, 1, 2, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 0, 1, 2, 2, 2, 1, 0, 1, 2, 2, 2, 1, 0, 0, 0, 1, 2, 0, 1, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Partials sums modulo 3 of the sequence : 1, a(1), a(1), a(2), a(2), a(3), a(3), a(4), a(4), a(5), ...

CROSSREFS

Cf. A033485.

Sequence in context: A001822 A112553 A026610 * A056562 A135220 A068320

Adjacent sequences:  A094448 A094449 A094450 * A094452 A094453 A094454

KEYWORD

easy,nonn

AUTHOR

DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Jun 04 2004

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 16 11:30 EST 2012. Contains 205907 sequences.