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!)
 A174382 T(1,0)=0 and for n > 1, T(n,k) is the number of k's in rows 1 to n - 1. 3
 0, 1, 1, 1, 1, 3, 1, 4, 0, 1, 2, 6, 0, 1, 1, 3, 8, 1, 1, 1, 0, 1, 4, 12, 1, 2, 1, 0, 1, 0, 1, 6, 16, 2, 2, 2, 0, 1, 0, 1, 0, 0, 0, 1, 11, 19, 5, 2, 2, 0, 2, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 19, 22, 8, 2, 2, 1, 2, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 27, 28, 11, 2, 2, 1, 2, 0, 2, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS Construction as in A030717 but with a different initial value at the top. LINKS Reinhard Zumkeller, Rows n = 1..25 of table, flattened EXAMPLE 0; 1; # one zero 1,1; # one zero, one one 1,3; # one zero, three ones 1,4,0,1; # one zero, four ones, zero twos, one three PROG (Haskell) import Data.List (sort, group) a174382 n k = a174382_tabf !! (n-1) !! k a174382_row n = a174382_tabf !! (n-1) a174382_tabf = iterate f [0] where    f xs = g (xs ++ [0, 0 ..]) [0..] (map head zs) (map length zs)      where g _ _ _ [] = []            g (u:us) (k:ks) hs'@(h:hs) vs'@(v:vs)              | k == h = u + v : g us ks hs vs              | k /= h = u : g us ks hs' vs'            zs = group \$ sort xs -- Reinhard Zumkeller, Apr 06 2014 CROSSREFS Cf. A240508 (row lengths). Sequence in context: A110790 A119719 A125162 * A123730 A143317 A130540 Adjacent sequences:  A174379 A174380 A174381 * A174383 A174384 A174385 KEYWORD easy,nonn,tabf,look AUTHOR Paolo P. Lava & Giorgio Balzarotti, Mar 17 2010 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 29 18:53 EDT 2020. Contains 338067 sequences. (Running on oeis4.)