Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A094451
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A094451 a(n) = A033485(n) modulo 3. +0
1
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; listen)
OFFSET

1,2

COMMENT

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 this_sequence A056562 A135220 A068320

Adjacent sequences: A094448 A094449 A094450 this_sequence A094452 A094453 A094454

KEYWORD

easy,nonn

AUTHOR

DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Jun 04 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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research