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!)
 A144464 Triangle T(n,m) read by rows: T(n,m) = 2^min(m,n-m). 8
 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 4, 2, 1, 1, 2, 4, 4, 2, 1, 1, 2, 4, 8, 4, 2, 1, 1, 2, 4, 8, 8, 4, 2, 1, 1, 2, 4, 8, 16, 8, 4, 2, 1, 1, 2, 4, 8, 16, 16, 8, 4, 2, 1, 1, 2, 4, 8, 16, 32, 16, 8, 4, 2, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS FORMULA Row sums: sum_{m=0..n} T(n,m) = A027383(n). T(n,k) = 2^A004197(n,k). - Philippe Deléham, Feb 25 2014 EXAMPLE The triangle starts in row n=0 as: {1}, {1, 1}, {1, 2, 1}, {1, 2, 2, 1}, {1, 2, 4, 2, 1}, {1, 2, 4, 4, 2, 1}, {1, 2, 4, 8, 4, 2, 1}, {1, 2, 4, 8, 8, 4, 2, 1}, {1, 2, 4, 8, 16, 8, 4, 2, 1}, {1, 2, 4, 8, 16, 16, 8, 4, 2, 1}, {1, 2, 4, 8, 16, 32, 16, 8, 4, 2, 1} MATHEMATICA Clear[f, t]; f[n_, m_] = If[m <= Floor[n/2], m, n - m]; Table[Table[f[n, m], {m, 0, n}], {n, 0, 10}]; Flatten[%] PROG (PARI) T(n, m)=1<

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 June 22 21:29 EDT 2021. Contains 345393 sequences. (Running on oeis4.)