Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,2

FORMULA

a(n) == 2a(n-1) mod 15 .

a(n)=(1/8)*{19*(n mod 4)-3*[(n+1) mod 4]+[(n+2) mod 4]+3*[(n+3) mod 4]}, with n>=0. - Paolo P. Lava (ppl(AT)spl.at), Jul 03 2008

a(n)=15/4-[3/4-(3/2)*I]*I^n-(5/4)*(-1)^n-[3/4+(3/2)*I]*(-I)^n, with n>=0 and I=sqrt(-1) - Paolo P. Lava (ppl(AT)spl.at), Jul 17 2008

CROSSREFS

Sequence in context: A010743 A072032 A023104 this_sequence A008952 A021407 A131609

Adjacent sequences: A133142 A133143 A133144 this_sequence A133146 A133147 A133148

KEYWORD

nonn

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Dec 16 2007

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 4 15:51 EST 2008. Contains 151308 sequences.


AT&T Labs Research