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.

A131437 (A000012 * A131436) + (A131436 * A000012) - A000012.

This page as a plain text file.
%I A131437 #10 Aug 26 2015 00:37:43
%S A131437 1,3,5,7,9,13,15,17,21,29,31,33,37,45,61,63,65,69,77,93,125,127,129,
%T A131437 133,141,157,189,253,255,257,261,269,285,317,381,509,511,513,517,525,
%U A131437 541,573,637,765,1021,1023,1025,1029,1037,1053,1085,1149,1277,1533,2045
%N A131437 (A000012 * A131436) + (A131436 * A000012) - A000012.
%C A131437 Left column = 2^n - 1; right border = A036563, 2^(n+1) - 3: (1, 5, 13, 29, 61, 125, ...). Row sums = A131438: (1, 8, 29, 82, 207, 492, 1129, ...).
%F A131437 (A000012 * A131436) + (A131436 * A000012) - A000012; as infinite lower triangular matrices.
%e A131437 First few rows of the triangle are:
%e A131437 1;
%e A131437 3, 5;
%e A131437 7, 9, 13;
%e A131437 15, 17, 21, 29;
%e A131437 31, 33, 37, 45, 61;
%e A131437 63, 65, 69, 77, 93, 125;
%e A131437 ...
%p A131437 A000012 := proc(n,k)
%p A131437         1 ;
%p A131437 end proc:
%p A131437 A131436 := proc(n,k)
%p A131437         if k = n then
%p A131437                 2^n-1 ;
%p A131437         else
%p A131437                 0;
%p A131437         end if;
%p A131437 end proc:
%p A131437 A131437 := proc(n,k)
%p A131437         add( A000012(n,i)*A131436(i,k) + A131436(n,i)*A000012(i,k),i=k..n) -1 ;
%p A131437 end proc:
%p A131437 seq(seq(A131437(n,k),k=1..n),n=1..15) ; # _R. J. Mathar_, Sep 24 2011
%Y A131437 Cf. A036563, A131436, A131438, A131439.
%K A131437 nonn,easy,tabl
%O A131437 1,2
%A A131437 _Gary W. Adamson_, Jul 11 2007
%E A131437 Corrected by _R. J. Mathar_, Sep 24 2011