login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119990 a(1) = 1. a(n) = sum of the earlier terms of the sequence, a(k), where GCD(n,a(k)) is <= k, for 1 <= k <= n-1. 0

%I #6 Apr 09 2014 10:15:51

%S 1,1,2,4,8,16,32,8,72,144,288,72,648,1296,2592,808,5992,6872,18856,

%T 37712,75424,150848,301696,598224,1201616,1201616,3600312,7199168,

%U 14404328,28808656,57617312,49885800,164522200,329642624,659285248

%N a(1) = 1. a(n) = sum of the earlier terms of the sequence, a(k), where GCD(n,a(k)) is <= k, for 1 <= k <= n-1.

%e GCD(8,a(k)), for those a(k)'s where 1 <= k <= 7, is {1,1,2,4,8,8,8}.

%e Of these GCD's, each but the 8's is <= k. So a(8) = 1+1+2+4 = 8.

%o (PARI) {m=36;print1(a=1,",");v=[a];for(n=2,m,a=0;for(k=1,n-1,if(gcd(n,v[k])<=k,a=a+v[k]));print1(a,",");v=concat(v,a))} - (Klaus Brockhaus, Aug 15 2006)

%K nonn

%O 1,3

%A _Leroy Quet_, Aug 03 2006

%E Corrected and extended by _Klaus Brockhaus_, Aug 15 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:06 EDT 2024. Contains 371964 sequences. (Running on oeis4.)