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!)
A099050 a(1)=1; for n>=2, a(n)=sum(1<=i<=j<=n-1, gcd(a(i),a(j))). 0

%I #5 Mar 30 2012 18:39:23

%S 1,1,3,8,19,42,92,194,398,808,1638,3334,6686,13392,26842,53708,107450,

%T 214952,430148,860340,1720826,3441688,6883446,13766950,27533998,

%U 55068040,110136196,220272460,440545040,881090532,1762181454,3524362990

%N a(1)=1; for n>=2, a(n)=sum(1<=i<=j<=n-1, gcd(a(i),a(j))).

%F a(n) is asymptotic to c*2^n where c=0.8205797305404015389561...

%K nonn

%O 1,3

%A _Benoit Cloitre_, Nov 13 2004

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 23 11:07 EDT 2024. Contains 371905 sequences. (Running on oeis4.)