[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A173259
Period 3: repeat [4, 1, 4].
2
4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4, 1, 4, 4
OFFSET
1,1
FORMULA
G.f.: (x + 4*x^2 + x^3)/(1 - x^3).
From Wesley Ivan Hurt, Jul 01 2016: (Start)
a(n) = a(n-3) for n>3.
a(n) = 3 + cos(2*n*Pi/3) + sqrt(3)*sin(2*n*Pi/3). (End)
MAPLE
seq(op([4, 1, 4]), n=1..50); # Wesley Ivan Hurt, Jul 01 2016
MATHEMATICA
PadRight[{}, 100, {4, 1, 4}] (* Wesley Ivan Hurt, Jul 01 2016 *)
PROG
(PARI) a(n)=[4, 1, 4][n%3+1] \\ Charles R Greathouse IV, Jun 02 2011
(Magma) &cat [[4, 1, 4]^^30]; // Wesley Ivan Hurt, Jul 01 2016
CROSSREFS
Sequence in context: A060037 A229705 A321593 * A021711 A334487 A327304
KEYWORD
nonn,easy,less
AUTHOR
Paul Curtz, Nov 22 2010
STATUS
approved