Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005262
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A005262 M2793
%S A005262 1,3,9,25,59,131,277,573,1167,2359,4745,9521,19075,38187,76413,152869,
%T A005262 305783,611615,1223281,2446617,4893291,9786643,19573349,39146765,78293599
%N A005262 [ (7*2^(n+1)-6n-10)/3 ].
%C A005262 Arises from Tower of Hanoi problem.
%D A005262 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A005262 Problem 1169, Crux Mathematicorum, 13 (No. 10, 1987), 328-332.
%H A005262 S. Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/MasterThesis.pdf">
               Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures</
               a>, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 
               1992.
%H A005262 S. Plouffe, <a href="http://www.lacim.uqam.ca/%7Eplouffe/articles/FonctionsGeneratrices.pdf">
               1031 Generating Functions and Conjectures</a>, Universit\'{e} du 
               Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
%p A005262 A005262:=-(1+z**2+4*z**3)/((z+1)*(2*z-1)*(z-1)**2); [Conjectured by S. 
               Plouffe in his 1992 dissertation.]
%Y A005262 Sequence in context: A032681 A005209 A112522 this_sequence A004255 A101357 
               A065971
%Y A005262 Adjacent sequences: A005259 A005260 A005261 this_sequence A005263 A005264 
               A005265
%K A005262 nonn
%O A005262 0,2
%A A005262 N. J. A. Sloane (njas(AT)research.att.com).

    
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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research