Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108983
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A108983
%S A108983 1,7,41,247,1481,8887,53321,319927,1919561,11517367,69104201,414625207,
%T A108983 2487751241,14926507447,89559044681,537354268087,3224125608521,
%U A108983 19344753651127,116068521906761,696411131440567,4178466788643401
%N A108983 Inverse binomial transform of A003950.
%F A108983 a(n) = 5a(n-1) + 6a(n-2), a(0) = 1, a(1) = 7.
%F A108983 a(2n) = 6a(2n-1) - 1; a(2n+1) = 6a(2n) + 1.
%F A108983 O.g.f.: -(1+2x)/[(1+x)(6x-1)]. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Apr 02 2008
%F A108983 a(n)=-(1/7)*[(-1)^n-8*6^n], with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), 
               Nov 19 2008]
%Y A108983 Sequence in context: A002315 A141813 A088165 this_sequence A115137 A036730 
               A080047
%Y A108983 Adjacent sequences: A108980 A108981 A108982 this_sequence A108984 A108985 
               A108986
%K A108983 nonn
%O A108983 0,2
%A A108983 Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Jul 23 2005
%E A108983 More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 02 2008

    
page 1

Search completed in 0.002 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 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research