Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092976
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092976 Consider all partitions of n into parts all of which are divisors of n; a(n) = number of distinct values taken by the product of the parts. +0
1
1, 2, 2, 3, 2, 7, 2, 5, 4, 10, 2, 19, 2, 13, 13, 9, 2, 37, 2, 29, 17, 19, 2, 61, 6, 22, 10, 39, 2, 247, 2, 17, 25, 28, 25, 127, 2, 31, 29, 97, 2, 450, 2, 59, 82, 37, 2, 217, 8, 146 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) > tau(n)+ A(n) + R(n), where tau(n) = number of divisors of n, A(n)= product of powers of nontrivial divisors whose sum with multiplicity is < n and R(n) = numbers of the form r^(k)> n where r is a divisor of n and k <= n/r.

EXAMPLE

a(10) = 10, the numbers arising are 1,2,4,5,8,10,16,20,25 and 32; e.g. 25 = 5*5, 8 = 2*2*2*1*1*1*1, 32 = 2*2*2*2*2, etc.

CROSSREFS

Cf. A092975.

Sequence in context: A094438 A156098 A015996 this_sequence A084705 A141652 A117754

Adjacent sequences: A092973 A092974 A092975 this_sequence A092977 A092978 A092979

KEYWORD

more,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 27 2004

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 06 2005

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