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

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

0,2

COMMENTS

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

1234/9999=0,123412341234... [From Eric Desbiaux (moongerms(AT)wanadoo.fr), Nov 03 2008]

Terms of the simple continued fraction of 5/(2*sqrt(39)-9). [From Paolo P. Lava (paoloplava(AT)gmail.com), Feb 16 2009]

FORMULA

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

a(n)=A010873(n)+1. Also a(n)=1/2*(5-(-1)^n-2*(-1)^((2n-1+(-1)^n)/4))). G.f.: g(x)=(4x^3+3x^2+2x+1)/(1-x^4)=(4x^5-5x^4+1)/((1-x^4)(1-x)^2). - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 08 2007

a(n) = (7*(n mod 4)+(n+1 mod 4)+(n+2 mod 4)+(n+3 mod 4))/6 (cf. forms of modular arithmetic of Paolo P. Lava, i.e. see A146094). [From Bruno Berselli (berselli.bruno(AT)yahoo.it), Sep 27 2010]

a(n) = 5/2 -cos(Pi*n/2) -sin(Pi*n/2) -(-1)^n/2.- R. J. Mathar, Oct 08 2011

CROSSREFS

Cf. A010872, A010873, A010874, A010875, A010876, A004526, A002264, A002265, A002266.

Cf. A177037 (decimal expansion of (9+2*sqrt(39))/15). [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 01 2010]

Sequence in context: A171171 A159957 A053840 * A011542 A053344 A092196

Adjacent sequences:  A010880 A010881 A010882 * A010884 A010885 A010886

KEYWORD

nonn

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 15 23:53 EST 2012. Contains 205860 sequences.