Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069907
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A069907
%S A069907 0,0,0,0,0,0,1,1,2,3,4,6,9,12,16,22,28,37,46,59,71,91,107,134,157,
%T A069907 193,222,271,308,371,419,499,559,661,734,860,952,1106,1216,1405,
%U A069907 1537,1764,1923,2193,2381,2703,2923,3301,3561,4002,4302,4817,5164
%N A069907 Number of hexagons that can be formed with perimeter n. In other words, 
               partitions of n into six parts such that the sum of any 5 is more 
               than the sixth.
%D A069907 G. E. Andrews, P. Paule and A. Riese, MacMahon's Partition Analysis IX: 
               k-gon partitions, Bull. Austral Math. Soc., 64 (2001), 321-329.
%H A069907 T. D. Noe, <a href="b069907.txt">Table of n, a(n) for n=0..1000</a>
%H A069907 G. E. Andrews, P. Paule and A. Riese, <a href="http://www.risc.uni-linz.ac.at/
               research/combinat/risc/publications/#ppaule">MacMahon's partition 
               analysis III. The Omega package</a>, p. 19.
%F A069907 G.f.: x^6*(1-x^4+x^5+x^7-x^8-x^13)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)*(1-x^6)*(1-x^8)*(1-x^10)).
%Y A069907 Cf. A005044, A062890, A069906.
%Y A069907 Sequence in context: A155510 A058647 A073576 this_sequence A001935 A083365 
               A007604
%Y A069907 Adjacent sequences: A069904 A069905 A069906 this_sequence A069908 A069909 
               A069910
%K A069907 nonn,easy
%O A069907 0,9
%A A069907 N. J. A. Sloane (njas(AT)research.att.com), May 05, 2002

    
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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research