

A145917


Triangle read by rows: to get nth row, start with 4n and successively add 5, 7, 9, 11, 13, ... until reaching a square.


1



0, 4, 1, 8, 3, 4, 12, 7, 0, 9, 16, 11, 4, 5, 16, 20, 15, 8, 1, 12, 25, 24, 19, 12, 3, 8, 21, 36, 28, 23, 16, 7, 4, 17, 32, 49, 32, 27, 20, 11, 0, 13, 28, 45, 64, 36, 31, 24, 15, 4, 9, 24, 41, 60, 81, 40, 35, 28, 19, 8, 5, 20, 37, 56, 77, 100, 44, 39, 32, 23, 12
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

Row n has n+1 entries.
T(n,k) = n^24*k, n, k > = 0 read by antidiagonals. T(n,k) is discriminant the quadratic equation x^2+n*x+k=0.  Boris Putievskiy, Jan 11 2013


LINKS

Boris Putievskiy, Rows n = 1..140 of triangle, flattened
Boris Putievskiy, Transformations (of) Integer Sequences And Pairing Functions, 2012, arXiv:1212.2732 [math.CO].


FORMULA

From Boris Putievskiy, Jan 11 2013: (Start)
a(n) = (A002260(n)1)^2  4*(A004736(n)1), n >0.
a(n) = (i1)^24(j1), n>0, where
i = nt*(t+1)/2,
j = (t*t+3*t+4)/2n,
t = floor((1+sqrt(8*n7))/2). (End)


CROSSREFS

Sequence in context: A271478 A112032 A199049 * A201661 A263498 A198314
Adjacent sequences: A145914 A145915 A145916 * A145918 A145919 A145920


KEYWORD

tabl,sign


AUTHOR

Jared Ricks (jaredricks(AT)yahoo.com), Oct 24 2008


STATUS

approved



