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.

A059274 Analog of A059226 in which left diagonal is all 1's.

This page as a plain text file.
%I A059274 #14 Feb 19 2025 17:31:41
%S A059274 1,1,2,1,5,8,1,11,28,39,1,23,80,164,214,1,47,208,548,1010,1274,1,95,
%T A059274 512,1632,3744,6490,8028,1,191,1216,4528,12248,25868,43132,52698,1,
%U A059274 383,2816,11968,37024,90624,181272,294366,356630,1,767
%N A059274 Analog of A059226 in which left diagonal is all 1's.
%H A059274 G. C. Greubel, <a href="/A059274/b059274.txt">Table of n, a(n) for the first 51 rows, flattened</a>
%e A059274 Triangle begins with:
%e A059274   1;
%e A059274   1,    2;
%e A059274   1,    5,    8;
%e A059274   1,   11,   28,   39;
%e A059274   1,   23,   80,  164,  214;
%e A059274   1,   47,  208,  548, 1010, 1274;
%e A059274   1,   95,  512, 1632, 3744, 6490, 8028;
%e A059274   ... - _G. C. Greubel_, Jan 03 2017
%t A059274 T[i_, j_]:= T[i, j] = Module[{r, s, t1}, If[i == 0 && j == 0, Return[1]];
%t A059274 If[j == 0, Return[1]]; t1 = T[i, j - 1]; For[r = 0, r <= i - j, r++,
%t A059274 For[s = 0, s <= j, s++, If[r + s != i, t1 = t1 + T[r + s, s]]]];
%t A059274 Return[t1]]; Table[T[n, k], {n, 0, 10}, {k, 0, n}] // Flatten (* _G. C. Greubel_, Jan 03 2017 *)
%Y A059274 Cf. A059226, A059274.
%K A059274 nonn,tabl
%O A059274 0,3
%A A059274 _N. J. A. Sloane_, Jan 24 2001