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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110794 a(1)=1. a(n) = sum{k=1 to n-1}(number of divisors of a(k) which also divide n). 0
1, 1, 2, 4, 4, 8, 6, 16, 9, 15, 10, 26, 13, 21, 21, 30, 16, 36, 18, 42, 35, 34, 22, 62, 28, 45, 40, 61, 28, 76, 31, 67, 43, 55, 48, 93, 36, 61, 53, 90, 40, 100, 43, 85, 81, 70, 46, 125, 55, 100, 67, 97, 53, 116, 74, 120, 73, 90, 58, 183, 63, 98, 104, 127, 84, 136, 68, 135, 90 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

EXAMPLE

The divisors of the first 5 terms of the sequence are: a(1):1; a(2):1; a(3):1,2; a(4):1,2,4; a(5):1,2,4. Eight of these divisors divide 6. (These divisors are 1;1;1,2;1,2;1,2.) So a(6) = 8.

MATHEMATICA

a = {1}; Do[AppendTo[a, Sum[Length[Select[Divisors[a[[i]]], Mod[Length[a] + 1, # ] == 0 &]], {i, 1, Length[a]}]], {70}]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 16 2007

CROSSREFS

Sequence in context: A065608 A184396 A077764 * A117295 A093820 A095400

Adjacent sequences:  A110791 A110792 A110793 * A110795 A110796 A110797

KEYWORD

nonn

AUTHOR

Leroy Quet Apr 26 2007

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Oct 16 2007

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 13 06:35 EST 2012. Contains 205451 sequences.