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.

A169629 Array T(n,k) read by antidiagonals: T(n,k) = Sum_{v=1..n, v odd} binomial(n,v)*k^v.

This page as a plain text file.
%I A169629 #20 Jul 22 2015 08:35:05
%S A169629 1,2,2,4,4,3,8,14,6,4,16,40,36,8,5,32,122,120,76,10,6,64,364,528,272,
%T A169629 140,12,7,128,1094,2016,1684,520,234,14,8,256,3280,8256,7448,4400,888,
%U A169629 364,16,9,512,9842,32640,40156,21280,9966,1400,536,18,10
%N A169629 Array T(n,k) read by antidiagonals: T(n,k) = Sum_{v=1..n, v odd} binomial(n,v)*k^v.
%C A169629 Antidiagonal sums are: 1, 4, 11, 32, 105, 366, 1387, ...
%e A169629    1,    2,    3,     4,      5,      6,       7, ...
%e A169629    2,    4,    6,     8,     10,     12,      14, ...
%e A169629    4,   14,   36,    76,    140,    234,     364, ...
%e A169629    8,   40,  120,   272,    520,    888,    1400, ...
%e A169629   16,  122,  528,  1684,   4400,   9966,   20272, ...
%e A169629   32,  364, 2016,  7448,  21280,  51012,  107744, ...
%e A169629   64, 1094, 8256, 40156, 148160, 450834, 1188544, ...
%o A169629 (PARI) tabl(nn) = {for (n=1, nn, for (k=1, nn, print1(sum(v=1, n, (v%2)*binomial(n, v)*k^v), ", ");); print(););} \\ _Michel Marcus_, Jul 22 2015
%Y A169629 Cf. A152011.
%Y A169629 Cf. A005843 (2nd line), A079908 (3rd line), A105374 (4th line).
%K A169629 nonn,tabl
%O A169629 1,2
%A A169629 _Roger L. Bagula_, Mar 03 2010