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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152204 Triangle read by rows: T(n,k) = 2n-4k+5 (n >= 0, 1 <=k <= 1+floor(n/2)). 4
1, 3, 5, 1, 7, 3, 9, 5, 1, 11, 7, 3, 13, 9, 5, 1, 15, 11, 7, 3, 17, 13, 9, 5, 1, 19, 15, 11, 7, 3, 21, 17, 13, 9, 5, 1, 23, 19, 15, 11, 7, 3, 25, 21, 17, 13, 9, 5, 1, 27, 23, 19, 15, 11, 7, 3, 29, 25, 21, 17, 13, 9, 5, 1, 31, 27, 23, 19, 15, 11, 7, 3, 33 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

All terms are odd, decreasing across rows. Row sums = A000217, the triangular numbers.

LINKS

Nathaniel Johnston, Table of n, a(n) for n = 1..10000

FORMULA

By columns, odd terms in every column, n-th column starts at row (2n-1).

EXAMPLE

First few rows of the triangle =

1

3

5  1

7  3

9  5  1

11 7  3

13 9  5  1

15 11 7  3

17 13 9  5 1

19 15 11 7 3

21 17 13 9 5 1

...

MAPLE

T := proc(n, k) return 2*n-4*k+5: end: seq(seq(T(n, k), k=1..1+floor(n/2)), n=0..20); # Nathaniel Johnston, May 01 2011

CROSSREFS

Cf. A000217.

Sequence in context: A133045 A158858 A202356 * A114216 A086233 A065395

Adjacent sequences:  A152201 A152202 A152203 * A152205 A152206 A152207

KEYWORD

nonn,tabf,easy

AUTHOR

Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 29 2008

EXTENSIONS

Edited by N. J. A. Sloane, Sep 25 2010, following a suggestion from Emeric Deutsch

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 17 12:23 EST 2012. Contains 206011 sequences.