Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A008481
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A008481
%S A008481 1,1,1,2,1,2,1,3,2,2,1,3,1,2,2,5,1,3,1,3,2,2,1,4,2,2,
%T A008481 3,3,1,3,1,7,2,2,2,4,1,2,2,4,1,3,1,3,3,2,1,6,2,3,2,3,
%U A008481 1,4,2,4,2,2,1,4,1,2,3,11,2,3,1,3,2,3,1,5,1,2,3,3,2,3
%N A008481 If n = Product (p_j^k_j) then a(n) = Sum partition(k_j).
%t A008481 Prepend[ Array[ Plus @@ (PartitionsP /@ Last[ Transpose[ FactorInteger[ 
               # ] ] ])&, 100, 2 ], 1 ]
%Y A008481 Sequence in context: A001222 A098893 A069248 this_sequence A127669 A056692 
               A039637
%Y A008481 Adjacent sequences: A008478 A008479 A008480 this_sequence A008482 A008483 
               A008484
%K A008481 nonn
%O A008481 1,4
%A A008481 Olivier Gerard (olivier.gerard(AT)gmail.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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research