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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082866 a(n) is the sum of the preceding terms where gcd(n,j)=1. 0
1, 2, 3, 4, 10, 11, 31, 45, 93, 128, 328, 370, 1026, 1461, 2898, 4390, 10801, 12197, 33799, 46082, 96616, 145278, 355574, 401570, 1063600, 1563754, 3226314, 4694447, 11660833, 12062393, 35384059, 51835986, 106656033, 158481218, 369773689 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

EXAMPLE

a(6)=11 as gcd(6,2)=2, gcd(6,3)=3 and gcd(6,4)=2. So a(6)=a(1)+a(5)=1+10=11.

PROG

(PARI) { v=vector(100, i, 0); v[1]=1; v[2]=2; print1("1, 2, "); for (i=3, 100, for (j=1, i-1, if (gcd(i, j) == 1, v[i]+=v[j])); print1(v[i]", ")) }

CROSSREFS

Sequence in context: A115897 A116019 A087460 * A085701 A051627 A023725

Adjacent sequences:  A082863 A082864 A082865 * A082867 A082868 A082869

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), May 24 2003

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 23:55 EST 2012. Contains 206085 sequences.