login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010882 Simple periodic sequence. 10
1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Partial sums are given by A130481(n)+n+1. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 08 2007

41/333=0,123123123... [From Eric Desbiaux (moongerms(AT)wanadoo.fr), Nov 03 2008]

Terms of the simple continued fraction for 3/(sqrt(37)-4). [From Paolo P. Lava (paoloplava(AT)gmail.com), Feb 16 2009]

a(n) = A180593(n+1)/3. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 25 2010]

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (0,0,1).

FORMULA

G.f.: (1+2x+3x^2)/(1-x^3). - Paul Barry (pbarry(AT)wit.ie), May 25 2003

a(n) = 1 + (n mod 3). - Paolo P. Lava (paoloplava(AT)gmail.com), Nov 21 2006

a(n) = A010872(n)+1. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 08 2007

a(n) = 6 - a(n-1) - a(n-2) for n > 1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 13 2008

a(n) = n+1-3*floor(n/3) = floor(41*10^(n+1)/333)-floor(41*10^n/333)*10; a(n)-a(n-3)=0 with n>2. - Bruno Berselli, Jun 28 2010

a(n) = floor((4*n+3)/3) mod 4. [From Gary Detlefs (gdetlefs(AT)aol.com), May 15 2011]

MATHEMATICA

Nest[ Flatten[ # /. {1 -> {1, 2}, 2 -> {3, 1}, 3 -> {2, 3}}] &, {1}, 7] (from Robert G. Wilson v Mar 08 2005)

CROSSREFS

Cf. A010872, A010873, A010874, A010875, A010876, A004526, A002264, A002265, A002266, A177036 (decimal expansion of (4+sqrt(37))/7).

Sequence in context: A082846 A117373 A132677 * A106590 A194074 A175469

Adjacent sequences:  A010879 A010880 A010881 * A010883 A010884 A010885

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 4 07:37 EST 2012. Contains 204806 sequences.