|
| |
|
|
A133145
|
|
Period 4: repeat 1, 2, 4, 8.
|
|
2
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| a(n) = A160700(A000079(n)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 10 2009]
Terms of the simple continued fraction of 13/[sqrt(3363)-49]. Decimal expansion of 416/3333. [From Paolo P. Lava (paoloplava(AT)gmail.com), Aug 05 2009]
|
|
|
LINKS
| Index entries for sequences related to linear recurrences with constant coefficients, signature (0,0,0,1).
|
|
|
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 (paoloplava(AT)gmail.com), 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 (paoloplava(AT)gmail.com), Jul 17 2008
a(n) = 2^n (mod 15). G.f.: (1+2*x)*(4*x^2+1)/ ((1-x) * (1+x) * (x^2+1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 13 2010]
|
|
|
PROG
| (PARI) a(n)=2^(n%4) [From Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Mar 27 2009]
(Other) sage: [power_mod(2, n, 15)for n in xrange(0, 80)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Nov 03 2009]
|
|
|
CROSSREFS
| Cf. A069705. [From Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Mar 27 2009]
Sequence in context: A010743 A072032 A023104 * A008952 A021407 A131609
Adjacent sequences: A133142 A133143 A133144 * A133146 A133147 A133148
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Paul Curtz (bpcrtz(AT)free.fr), Dec 16 2007
|
| |
|
|
