Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096885
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A096885
%S A096885 1,100,10001,1000200,100030001,10004000300,1000500060001,
%T A096885 100060010000400,10007001500100001,1000800210020000500,
%U A096885 100090028003500150001,10010003600560035000600
%N A096885 Related to diagonals of Pascal's triangle.
%H A096885 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A096885 a(n)=sum{k=0..floor(n/2), binomial(n-k, k)100^(n-2k) }.
%F A096885 a(n)=100*a(n-1)+a(n-2), n>1 ; a(0)=1, a(1)=100 . G.f.: 1/(1-100*x-x^2). 
               [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 23 2008]
%Y A096885 Cf. A096884, A007318, A000045.
%Y A096885 Sequence in context: A029801 A098608 A045799 this_sequence A027576 A099374 
               A163663
%Y A096885 Adjacent sequences: A096882 A096883 A096884 this_sequence A096886 A096887 
               A096888
%K A096885 easy,nonn
%O A096885 0,2
%A A096885 Paul Barry (pbarry(AT)wit.ie), Jul 14 2004

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research