This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A185914 Array: T(n,k)=k-n+1 for k>=n; T(n,k)=0 for k
 1, 2, 0, 3, 1, 0, 4, 2, 0, 0, 5, 3, 1, 0, 0, 6, 4, 2, 0, 0, 0, 7, 5, 3, 1, 0, 0, 0, 8, 6, 4, 2, 0, 0, 0, 0, 9, 7, 5, 3, 1, 0, 0, 0, 0, 10, 8, 6, 4, 2, 0, 0, 0, 0, 0, 11, 9, 7, 5, 3, 1, 0, 0, 0, 0, 0, 12, 10, 8, 6, 4, 2, 0, 0, 0, 0, 0, 0, 13, 11, 9, 7, 5, 3, 1, 0, 0, 0, 0, 0, 0, 14, 12, 10, 8, 6, 4, 2, 0, 0, 0, 0, 0, 0, 0 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A member of the accumulation chain ...< A185916 < A185914 < A185915 < ... (See A144112 for definitions of weight array and accumulation array.) LINKS G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened FORMULA T(n,k) = k-n+1 for k>=n; T(n,k)=0 for k=1, n>=1. EXAMPLE Northwest corner: 1...2...3...4...5...6...7...8...9 0...1...2...3...4...5...6...7...8 0...0...1...2...3...4...5...6...7 0...0...0...1...2...3...4...5...6 0...0...0...0...1...2...3...4...5 MATHEMATICA (* This program generates the array A185914, its accumulation array A185915, and its weight array A185916. *) f[n_, 0]:=0; f[0, k_]:=0; (* needed for the weight array *) f[n_, k_]:=k-n+1; f[n_, k_]:=0/; k0, n>0]; TableForm[Table[w[n, k], {n, 1, 10}, {k, 1, 15}]] (* A184916 *) Table[w[n-k+1, k], {n, 14}, {k, n, 1, -1}]//Flatten CROSSREFS Cf. A144112, A185915, A185916. Sequence in context: A127374 A098862 A003988 * A144257 A257232 A208544 Adjacent sequences:  A185911 A185912 A185913 * A185915 A185916 A185917 KEYWORD nonn,tabl AUTHOR Clark Kimberling, Feb 06 2011 STATUS approved

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.

Last modified October 21 04:44 EDT 2018. Contains 316404 sequences. (Running on oeis4.)