|
%I #14 Jan 25 2020 01:37:49
%S 1,100,10001,1000200,100030001,10004000300,1000500060001,
%T 100060010000400,10007001500100001,1000800210020000500,
%U 100090028003500150001,10010003600560035000600
%N Related to diagonals of Pascal's triangle.
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (100,1).
%F a(n) = Sum_{k=0..floor(n/2)} binomial(n-k, k)*100^(n-2k).
%F From _Philippe Deléham_, Nov 23 2008: (Start)
%F a(n) = 100*a(n-1) + a(n-2), n > 1; a(0)=1, a(1)=100.
%F G.f.: 1/(1-100*x-x^2). (End)
%Y Cf. A096884, A007318, A000045.
%K easy,nonn
%O 0,2
%A _Paul Barry_, Jul 14 2004
| 