Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005705
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A005705 M0552
%S A005705 1,2,3,4,6,8,10,12,15,18,21,24,28,32,36,40,46,52,58,64,72,80,88,96,106,
%T A005705 116,126,136,148,160,172,184,199,214,229,244,262,280,298,316,337,358,
%U A005705 379,400,424,448,472,496,524,552,580,608,640,672,704,736,772,808,844
%N A005705 Number of partitions of 4n into powers of 4.
%C A005705 The g.f. (1+z)*(z**2+1)*(z**4+1)**2/(z-1)/(2*z**8-1) conjectured by S. 
               Plouffe in his 1992 dissertation is wrong.
%D A005705 R. K. Guy, personal communication.
%D A005705 O. J. Rodseth and J. A. Sellers, On a Restricted m-Non-Squashing Partition 
               Function, Journal of Integer Sequences, Vol. 8 (2005), Article 05.5.4.
%D A005705 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A005705 M. D. Hirschhorn and J. A. Sellers, A different view of m-ary partitions, 
               <a href="http://www.lacim.uqam.ca/~plouffe/OEIS/archive_in_pdf/mike-m-ary.pdf">
               Australasian J. Combin.</a>, 30 (2004), 193-196.
%H A005705 M. D. Hirschhorn and J. A. Sellers, <a href="http://www.math.psu.edu/
               sellersj/mike-m-ary.pdf">A different view of m-ary partitions</a>
%H A005705 M. Latapy, <a href="http://www.dmtcs.org/proceedings/">Partitions of 
               an integer into powers</a>, DMTCS Proceedings AA (DM-CCG), 2001, 
               215-228.
%H A005705 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 A005705 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.
%F A005705 a(n) = a(n-1)+a([n/4]).
%Y A005705 Cf. A000041, A000123, A005704, A005706.
%Y A005705 Sequence in context: A019293 A130519 A001972 this_sequence A139542 A093717 
               A002093
%Y A005705 Adjacent sequences: A005702 A005703 A005704 this_sequence A005706 A005707 
               A005708
%K A005705 nonn,easy
%O A005705 0,2
%A A005705 N. J. A. Sloane (njas(AT)research.att.com).
%E A005705 Formula and more terms from Henry Bottomley (se16(AT)btinternet.com), 
               Apr 30 2001

    
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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research