login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057022 floor[sum of factors of n / number of factors of n], i.e. [sigma(n)/d(n)]. 3
1, 1, 2, 2, 3, 3, 4, 3, 4, 4, 6, 4, 7, 6, 6, 6, 9, 6, 10, 7, 8, 9, 12, 7, 10, 10, 10, 9, 15, 9, 16, 10, 12, 13, 12, 10, 19, 15, 14, 11, 21, 12, 22, 14, 13, 18, 24, 12, 19, 15, 18, 16, 27, 15, 18, 15, 20, 22, 30, 14, 31, 24, 17, 18, 21, 18, 34, 21, 24, 18 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

_Reinhard Zumkeller_, Table of n, a(n) for n = 1..10000

FORMULA

a(n) =(A000203(n)-A054025(n))/A000005(n).

EXAMPLE

a(4)=2 since the 3 factors of 4 are 1, 2 and 4 and [(1+2+4)/3]=[7/3]=2.

PROG

(Haskell)

a057022 n = a000203 n `div` a000005 n

-- Reinhard Zumkeller, Jan 06 2012

CROSSREFS

Cf. A000005, A000203, A009205, A054025, A057020, A057021.

Sequence in context: A056239 A161511 A100197 * A087504 A067539 A166312

Adjacent sequences:  A057019 A057020 A057021 * A057023 A057024 A057025

KEYWORD

nonn

AUTHOR

Henry Bottomley, Jul 21 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 20 02:57 EDT 2013. Contains 225446 sequences.