Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A159956
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A159956 Period 16 : 0,1,2,3,1,2,3,0,2,3,0,1,3,0,1,2 . +0
1
0, 1, 2, 3, 1, 2, 3, 0, 2, 3, 0, 1, 3, 0, 1, 2, 0, 1, 2, 3, 1, 2, 3, 0, 2, 3, 0, 1, 3, 0, 1, 2, 0, 1, 2, 3, 1, 2, 3, 0, 2, 3, 0, 1, 3, 0, 1, 2, 0, 1, 2, 3, 1, 2, 3, 0, 2, 3, 0, 1, 3, 0, 1, 2, 0, 1, 2, 3, 1, 2, 3, 0, 2, 3, 0, 1, 3, 0, 1, 2, 0, 1, 2, 3, 1, 2, 3, 0, 2, 3, 0, 1, 3, 0, 1, 2, 0, 1, 2, 3, 1, 2, 3, 0, 2 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n+16)=a(n) with a(0)=a(7)=a(10)=a(13)=0, a(1)=a(4)=a(11)=a(14)=1, a(2)=a(5)=a(8)=a(15)=2, a(3)=a(6)=a(9)=a(12)=3 .

a(n)=(1/80)*{11*(n mod 16)-4*[(n+1) mod 16]-4*[(n+2) mod 16]+16*[(n+3) mod 16]-9*[(n+4) mod 16]-4*[(n+5) mod 16]+16*[(n+6) mod 16]-4*[(n+7) mod 16]-9*[(n+8) mod 16]+16*[(n+9) mod 16]-4*[(n+10) mod 16]-4*[(n+11) mod 16]+11*[(n+12) mod 16]-4*[(n+13) mod 16]-4*[(n+14) mod 16]-4*[(n+15) mod 16]}, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Nov 12 2009]

CROSSREFS

Sequence in context: A106798 A121884 A079087 this_sequence A053839 A047896 A073645

Adjacent sequences: A159953 A159954 A159955 this_sequence A159957 A159958 A159959

KEYWORD

easy,nonn,new

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Apr 27 2009

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 November 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research