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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A077567 Least k >= 2 such that sigma(n) divides sigma(n^k). 0
2, 3, 3, 4, 3, 3, 3, 5, 4, 3, 3, 5, 3, 3, 3, 6, 3, 7, 3, 5, 3, 3, 3, 3, 4, 3, 5, 7, 3, 3, 3, 7, 3, 3, 3, 4, 3, 3, 3, 5, 3, 3, 3, 5, 3, 3, 3, 11, 4, 7, 3, 7, 3, 5, 3, 3, 3, 3, 3, 5, 3, 3, 7, 8, 3, 3, 3, 5, 3, 3, 3, 13, 3, 3, 7, 5, 3, 3, 3, 5, 6, 3, 3, 5, 3, 3, 3, 5, 3, 3, 3, 5, 3, 3, 3, 7, 3, 4, 7, 4, 3, 3, 3 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

CROSSREFS

Sequence in context: A139069 A071866 A077603 * A096344 A030349 A085887

Adjacent sequences:  A077564 A077565 A077566 * A077568 A077569 A077570

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 01 2002

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 February 16 02:51 EST 2012. Contains 205860 sequences.