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-10 of 11 results. Next

A047151 Sum{T(i,n-i): i=0,1,...,n}, array T as in A047150.

Original entry on oeis.org

1, 2, 4, 6, 12, 24, 42, 84, 168, 336, 672, 1240, 2480, 4960, 9471, 18942, 37884, 75768, 151536, 292344, 584688, 1169376, 2287951, 4575902, 9151804, 18303608, 36607216, 71849311, 143698622, 287397244, 568041906, 1136083812, 2272167624
Offset: 0

Views

Author

Keywords

A047152 T(n,n), array T as in A047150.

Original entry on oeis.org

1, 2, 4, 14, 44, 158, 582, 2068, 7658, 28365, 106688, 405144, 1537720, 5870813, 22477625, 86391408, 333202409, 1287571951, 4986174232, 19342971327, 75166542530, 292574047008, 1140326119463, 4449984515413, 17384718120910
Offset: 0

Views

Author

Keywords

A047153 T(n,n-1), array T as in A047150.

Original entry on oeis.org

1, 3, 8, 27, 90, 320, 1170, 4243, 15700, 58415, 219547, 831826, 3160495, 12062741, 46187360, 177436402, 683765925, 2640846975, 10221025773, 39630943814, 153924315307, 598776610777, 2332494389552, 9097468059843
Offset: 1

Views

Author

Keywords

A047154 T(n,n-2), array T as in A047150.

Original entry on oeis.org

1, 4, 13, 46, 162, 588, 2175, 8042, 30050, 112859, 426682, 1622775, 6191928, 23709735, 91044994, 350563516, 1353275024, 5234851541, 20287972487, 78757772777, 306202563769, 1192168270089, 4647483544430, 18138518078549
Offset: 2

Views

Author

Keywords

A047155 T(n,n-3), array T as in A047150.

Original entry on oeis.org

1, 5, 19, 72, 268, 1005, 3799, 14350, 54444, 207135, 790949, 3031433, 11646994, 44857634, 173127114, 669509099, 2594004566, 10066946714, 39126828963, 152278248462, 593391659312, 2314989154878, 9041050018706
Offset: 3

Views

Author

Keywords

Crossrefs

Cf. A047150.

A047156 T(n,n+1), array T as in A047150.

Original entry on oeis.org

1, 1, 6, 17, 68, 262, 898, 3415, 12665, 48273, 185597, 705894, 2710318, 10414884, 40204048, 155766007, 603806026, 2345327257, 9121945554, 35535598716, 138649731701, 541549508686, 2117490125861, 8287250061067, 32463187726182
Offset: 0

Views

Author

Keywords

Crossrefs

Cf. A047150.

A047157 T(n,n+2), array T as in A047150.

Original entry on oeis.org

1, 2, 3, 24, 104, 316, 1347, 5007, 19908, 78909, 300750, 1172598, 4544071, 17726423, 69374599, 270603617, 1057755306, 4135771322, 16192627389, 63483189171, 248975461678, 977164006398, 3837265545654, 15078469605272
Offset: 0

Views

Author

Keywords

A047158 T(n,n+3), array T as in A047150.

Original entry on oeis.org

1, 3, 7, 36, 54, 449, 1592, 7243, 30636, 115153, 466704, 1833753, 7311539, 29170551, 114837610, 453949280, 1790444065, 7070681835, 27947590455, 110325729977, 435614497712, 1719775419793, 6791219544205, 26827316475982
Offset: 0

Views

Author

Keywords

A047159 T(2n,n), array T as in A047150.

Original entry on oeis.org

1, 3, 13, 72, 417, 2509, 15438, 96310, 607231, 3859594, 24689329, 158756701, 1025210362, 6644336882, 43193144567, 281525730152, 1839132807282, 12038672624172, 78943126865652, 518485130526736, 3410150902046028
Offset: 0

Views

Author

Clark Kimberling. Definition revised Dec 08 2006

Keywords

A047130 Array read by descending antidiagonals: T(h,k) is the number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no up-step crosses the line y = 3x/4. (Thus a path crosses the line only at lattice points and on right-steps.)

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 2, 3, 1, 1, 4, 5, 5, 4, 1, 1, 5, 9, 5, 9, 5, 1, 1, 6, 14, 14, 14, 14, 6, 1, 1, 7, 20, 28, 28, 28, 20, 7, 1, 1, 8, 27, 48, 56, 28, 48, 27, 8, 1, 1, 9, 35, 75, 104, 84, 76, 75, 35, 9, 1, 1, 10, 44, 110, 179, 188, 84
Offset: 0

Views

Author

Clark Kimberling. Definition revised Dec 08 2006

Keywords

Examples

			Array begins:
===================================
h\k | 0 1  2  3   4   5   6   7
----+------------------------------
  0 | 1 1  1  1   1   1   1   1 ...
  1 | 1 1  2  3   4   5   6   7 ...
  2 | 1 2  2  5   9  14  20  27 ...
  3 | 1 3  5  5  14  28  48  75 ...
  4 | 1 4  9 14  28  56 104 179 ...
  5 | 1 5 14 28  28  84 188 367 ...
  6 | 1 6 20 48  76  84 272 639 ...
  7 | 1 7 27 75 151 235 272 911 ...
  ...
		

Crossrefs

Programs

  • PARI
    A(h, k=h)={my(M=matrix(h+1, k+1, i, j, 1)); for(h=1, h, for(k=1, k, M[1+h, 1+k] = M[h, 1+k] + if(4*k>3*h && 4*(k-1)<3*h, 0, M[1+h, k]))); M}
    { my(T=A(10)); for(i=1, #T, print(T[i, ]))} \\ Andrew Howroyd, Jan 19 2020
Showing 1-10 of 11 results. Next