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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A201208 One 1, two 2's, three 1's, four 2's, five 1's, ... 2

%I

%S 1,2,2,1,1,1,2,2,2,2,1,1,1,1,1,2,2,2,2,2,2,1,1,1,1,1,1,1,2,2,2,2,2,2,

%T 2,2,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,2,2,

%U 2,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2

%N One 1, two 2's, three 1's, four 2's, five 1's, ...

%F a(n)=A057212 + 1 (T. D. Noe, Nov 28 2011)

%e May be written as a triangle:

%e 1

%e 2 2

%e 1 1 1

%e 2 2 2 2

%e 1 1 1 1 1

%e 2 2 2 2 2 2

%e 1 1 1 1 1 1 1

%e Row sums are A022998(n+1).

%t ReplaceAll[ColumnForm[Table[Mod[k, 2], {k, 12}, {n, k}], Center], 0 -> 2] (* _Alonso del Arte_, Nov 28 2011 *)

%o (Haskell)

%o a201208 n = a201208_list !! (n-1)

%o a201208_list = concat $ zipWith ($) (map replicate [1..]) a000034_list

%o -- _Reinhard Zumkeller_, Dec 02 2011

%Y Cf. A057212, A022998.

%Y Cf. A000034.

%K nonn,tabl,easy

%O 1,2

%A _Paul Curtz_, Nov 28 2011

%E Edited by _N. J. A. Sloane_, Dec 02 2011

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 04:27 EST 2016. Contains 278902 sequences.