The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A159798 Triangle read by rows in which row n lists n terms, starting with 1, such that the difference between successive terms is equal to n-3. 13
 1, 1, 0, 1, 1, 1, 1, 2, 3, 4, 1, 3, 5, 7, 9, 1, 4, 7, 10, 13, 16, 1, 5, 9, 13, 17, 21, 25, 1, 6, 11, 16, 21, 26, 31, 36, 1, 7, 13, 19, 25, 31, 37, 43, 49, 1, 8, 15, 22, 29, 36, 43, 50, 57, 64, 1, 9, 17, 25, 33, 41, 49, 57, 65, 73, 81, 1, 10, 19, 28, 37, 46, 55, 64, 73, 82, 91, 100, 1, 11 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 COMMENTS Note that for n>1 the last term of the n-th row is the square A000290(n-2). Row sums are n*(n^2-4*n+5)/2 = 1, 1, 3, 10, 25, 51, 91, 148, 225, ... - R. J. Mathar, Jul 17 2009, Jul 20 2009 Row sums are the positive terms of A162607. - Omar E. Pol, Jul 24 2009 LINKS G. C. Greubel, Table of n, a(n) for the first 100 rows, flattened FORMULA T(n,k) = 1 + k*(n-3), 0<=k

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

Last modified August 4 09:03 EDT 2020. Contains 336201 sequences. (Running on oeis4.)