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”).

A010703
Period 2: repeat (3,5).
9
3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5
OFFSET
0,1
COMMENTS
From Klaus Brockhaus, Dec 10 2009: (Start)
Interleaving of A010701 and A010716.
Also continued fraction expansion of (15+sqrt(285))/10.
Also decimal expansion of 35/99.
Binomial transform of 3 followed by A084633 without initial terms 1,0.
Inverse binomial transform of A171497. (End)
FORMULA
From Klaus Brockhaus, Dec 10 2009: (Start)
a(n) = a(n-2) for n > 1; a(0) = 3, a(1) = 5.
G.f.: (3+5*x)/((1-x)*(1+x)). (End)
a(n) = 4 - (-1)^n. - Aaron J Grech, Aug 02 2024
E.g.f.: 3*cosh(x) + 5*sinh(x). - Stefano Spezia, Aug 04 2024
MATHEMATICA
Table[If[OddQ[n], 3, 5], {n, 1, 50}] (* Stefan Steinerberger, Apr 10 2006 *)
PadRight[{}, 120, {3, 5}] (* Harvey P. Dale, Sep 03 2012 *)
PROG
(Magma) &cat[ [3, 5]: n in [1..53] ]; // Klaus Brockhaus, Dec 10 2009
(PARI) a(n)=3+n%2*2 \\ Charles R Greathouse IV, Nov 20 2011
CROSSREFS
Cf. A010701 (all 3's sequence), A010716 (all 5's sequence), A084633 (inverse binomial transform of repeated odd numbers), A171497.
Sequence in context: A236965 A259684 A214287 * A107489 A152050 A103506
KEYWORD
nonn,easy
STATUS
approved