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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111650 2n appears n times (n>0). 3
2, 4, 4, 6, 6, 6, 8, 8, 8, 8, 10, 10, 10, 10, 10, 12, 12, 12, 12, 12, 12, 14, 14, 14, 14, 14, 14, 14, 16, 16, 16, 16, 16, 16, 16, 16, 18, 18, 18, 18, 18, 18, 18, 18, 18, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 24, 24, 24, 24, 24, 24, 24 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Seen as a triangle read by rows: T(n,k) = 2*n, 1<=k<=n. [Reinhard Zumkeller, Mar 18 2011]

PROG

(Haskell)

a111650 n = a111650_list !! (n-1)

a111650_list = concat $ zipWith ($) (map replicate [1..]) [2, 4..]

-- Reinhard Zumkeller, Mar 18 2011

CROSSREFS

Cf. A000194, A111651, A111652.

Sequence in context: A191682 A113724 A161794 * A156686 A085914 A014684

Adjacent sequences:  A111647 A111648 A111649 * A111651 A111652 A111653

KEYWORD

easy,nonn,tabl

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Aug 12 2005

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 16 17:48 EST 2012. Contains 205939 sequences.