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.

A134395 A007318 * A077028.

This page as a plain text file.
%I A134395 #12 Mar 25 2022 00:34:29
%S A134395 1,2,1,4,4,1,8,12,6,1,16,32,23,8,1,32,80,72,37,10,1,64,192,201,132,54,
%T A134395 12,1,128,448,522,405,216,74,14,1,256,1024,1291,1128,723,328,97,16,1,
%U A134395 512,2304,3084,2941,2154,1191,472,123,18,1,1024,5120,7181,7316,5920,3788,1850,652,152,20,1
%N A134395 A007318 * A077028.
%C A134395 Row sums = A134396: (1, 3, 9, 27, 80, 232, 656, ...).
%F A134395 A007318 * A077028 as infinite lower triangular matrices.
%e A134395 First few rows of the triangle:
%e A134395    1;
%e A134395    2,  1;
%e A134395    4,  4,  1;
%e A134395    8, 12,  6,  1;
%e A134395   16, 32, 23,  8,  1;
%e A134395   32, 80, 72, 37, 10,  1;
%e A134395   ...
%p A134395 A007318 := proc(n,k) binomial(n,k) ; end: A077028 := proc(i,j) if j <= i then (i-j)*(j-1)+1 ; else 0 ; fi ; end: A134395 := proc(n,m) add(A007318(n,k)*A077028(k+1,m+1),k=0..n) ; end: for n from 0 to 15 do for m from 0 to n do printf("%d,",A134395(n,m)) ; od: od: # _R. J. Mathar_, Jun 08 2008
%Y A134395 Cf. A077028, A134396.
%K A134395 nonn,tabl
%O A134395 0,2
%A A134395 _Gary W. Adamson_, Oct 23 2007
%E A134395 Corrected and extended by _R. J. Mathar_, Jun 08 2008