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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053079 a(1)=1; a(m+1)= sum{k=1 to m} [GCD(k, a(m+1-k))]. 0
1, 1, 2, 3, 5, 5, 9, 7, 9, 17, 15, 13, 17, 15, 27, 33, 21, 27, 29, 29, 35, 33, 29, 45, 55, 51, 73, 41, 59, 61, 57, 39, 63, 57, 59, 85, 49, 87, 65, 65, 77, 93, 83, 107, 117, 73, 91, 95, 137, 97, 117, 125, 115, 131 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

EXAMPLE

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

CROSSREFS

Sequence in context: A006447 A014237 A033885 * A158901 A096736 A128188

Adjacent sequences:  A053076 A053077 A053078 * A053080 A053081 A053082

KEYWORD

nonn

AUTHOR

Leroy Quet Feb 25 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 17 15:54 EST 2012. Contains 206050 sequences.