Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108964
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108964 Write n in balanced ternary notation, omit any zeros, and form the left-to-right alternating sum mod 3. +0
1
0, 1, 2, 1, 0, 1, 2, 0, 2, 1, 0, 2, 0, 1, 2, 1, 0, 1, 2, 0, 1, 0, 2, 1, 2, 0, 2, 1, 0 (list; graph; listen)
OFFSET

0,3

COMMENT

This sequence and A036581 are squarefree (they do not contain any substring XX).

EXAMPLE

1="1", so a(1)=1; 2=3-1="1,-1", so a(2)=2; 3=3="1,0", so a(3)=1; 4=3+1="1,1", so a(4)=0; ...

CROSSREFS

Cf. A036581.

Sequence in context: A083056 A061896 A069850 this_sequence A036581 A135055 A035148

Adjacent sequences: A108961 A108962 A108963 this_sequence A108965 A108966 A108967

KEYWORD

nonn,more

AUTHOR

R. William Gosper (rwg(AT)osots.com), Jul 22 2005

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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research