Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082866
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A082866
%S A082866 1,2,3,4,10,11,31,45,93,128,328,370,1026,1461,2898,4390,10801,12197,
%T A082866 33799,46082,96616,145278,355574,401570,1063600,1563754,3226314,4694447,
%U A082866 11660833,12062393,35384059,51835986,106656033,158481218,369773689
%N A082866 a(n) is the sum of the preceding terms where gcd(n,j)=1.
%e A082866 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.
%o A082866 (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]",")) 
               }
%Y A082866 Sequence in context: A115897 A116019 A087460 this_sequence A085701 A051627 
               A023725
%Y A082866 Adjacent sequences: A082863 A082864 A082865 this_sequence A082867 A082868 
               A082869
%K A082866 nonn
%O A082866 1,2
%A A082866 Jon Perry (perry(AT)globalnet.co.uk), May 24 2003

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research