Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081326
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081326 Number of partitions of n into two 3-smooth numbers. +0
8
0, 1, 1, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 3, 2, 2, 0, 3, 2, 2, 2, 3, 1, 3, 1, 2, 3, 2, 2, 4, 1, 2, 2, 3, 1, 2, 1, 2, 2, 0, 0, 3, 1, 2, 2, 2, 0, 3, 1, 3, 2, 1, 1, 3, 0, 1, 2, 2, 1, 3, 1, 2, 0, 2, 0, 4, 2, 1, 2, 2, 0, 2, 0, 3, 2, 2, 1, 3, 1, 1, 1, 2, 1, 3, 1, 0, 1, 0, 0, 3, 2, 1, 3, 2, 0, 2, 0, 2, 2 (list; graph; listen)
OFFSET

1,4

LINKS

Ivars Peterson, Medieval Harmony.

Eric Weisstein's World of Mathematics, Smooth Number.

EXAMPLE

n=10 has a(10)=3 partitions into 3-smooth numbers: 10=1+3^2=2+2^3=2^2+2*3; n=9 has a(9)=2 partitions into 3-smooth numbers: 9=1+2^3=3+2*3.

CROSSREFS

Cf. A081329, A081330, A081327, A081328, A003586.

Sequence in context: A131841 A122921 A108128 this_sequence A095139 A109038 A080342

Adjacent sequences: A081323 A081324 A081325 this_sequence A081327 A081328 A081329

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 19 2003

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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research