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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A056144 a(1) = 1, a(m+1) = sum_{k=1 to m}[GCD(m, a(k))]. 0
1, 1, 2, 3, 5, 9, 11, 7, 9, 27, 15, 21, 25, 13, 27, 49, 17, 33, 59, 19, 33, 69, 53, 45, 47, 61, 39, 117, 47, 29, 89, 31, 33, 161, 51, 75, 105, 37, 57, 159, 65, 41, 135, 43, 85, 251, 91, 139, 89, 127, 127, 171, 113, 157, 199, 131, 93, 227, 87, 117, 185, 121, 123, 227, 65 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

EXAMPLE

a(7) = GCD(6,1) + GCD(6,1) + GCD(6,2) + GCD(6,3) + GCD(6,5) + GCD(6,9) = 1 + 1 + 2 + 3 + 1 + 3 = 11.

CROSSREFS

Sequence in context: A090845 A058108 A174512 * A186776 A191183 A078645

Adjacent sequences:  A056141 A056142 A056143 * A056145 A056146 A056147

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Aug 04 2000

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 14 14:07 EST 2012. Contains 205623 sequences.