cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A200741 Table of distinct numbers of the form v*w + w*u + u*v with 1 <= u <= v <= w <= n.

Original entry on oeis.org

3, 3, 5, 8, 12, 3, 5, 7, 8, 11, 12, 15, 16, 21, 27, 3, 5, 7, 8, 9, 11, 12, 14, 15, 16, 19, 20, 21, 24, 26, 27, 32, 33, 40, 48, 3, 5, 7, 8, 9, 11, 12, 14, 15, 16, 17, 19, 20, 21, 23, 24, 26, 27, 29, 31, 32, 33, 35, 38, 39, 40, 45, 47, 48, 55, 56, 65, 75, 3, 5
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 21 2011

Keywords

Comments

A100440(n) = number of terms in row n;
T(1,1) = 3; right edge: T(n,A100440(n)) = A033428(n);
T(n,k) = T(n+1,k) for k <= A200742(n);
distinct terms per row of table in A200737.

Programs

  • Haskell
    import Data.List (nub)
    a200741 n k = a200741_tabl !! (n-1) !! (k-1)
    a200741_row = nub . a200737_row
    a200741_tabl = map a200741_row [1..]
  • Mathematica
    row[n_] := Table[v*w + w*u + u*v, {u, 1, n}, {v, u, n}, {w, v, n}] // Flatten // Union; Table[row[n], {n, 1, 6}] // Flatten (* Jean-François Alcover, Dec 04 2013 *)

A200738 Greatest number such that in the triangle A200737 the first terms in row n coincide with row n+1.

Original entry on oeis.org

1, 2, 4, 6, 8, 11, 14, 16, 20, 23, 26, 31, 35, 38, 43, 48, 51, 57, 63, 65, 72, 78, 83, 89, 94, 100, 107, 113, 118, 126, 133, 137, 146, 153, 158, 167, 175, 180, 190, 197, 203, 213, 221, 227, 234, 245, 253, 262, 271, 276, 288, 296, 304, 316, 323, 329, 342, 354
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 21 2011

Keywords

Comments

Shorter rows in A200737 are contained in longer rows; a(n) gives length of common initial segments of consecutive rows: A200737(n,k) = A200737(n+1,k) for k <= a(n).

Crossrefs

Cf. A200742.

Programs

  • Haskell
    a200738 n = a200738_list !! (n-1)
    a200738_list = f a200737_tabl where
       f (rs:rss'@(rs':rss)) =
         (length $ takeWhile (== EQ) $ zipWith compare rs rs') : f rss'
Showing 1-2 of 2 results.