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!)
A286946 a(1) = 1; a(n+1) = Sum_{k=1..n} a(n)/gcd(a(k),a(n)). 3
1, 1, 2, 5, 16, 57, 286, 1431, 9064, 51398, 359787, 3118155, 25568872, 223727631, 2311852188, 15990310968, 105935810164, 1038449718056, 10903722039589, 185715007642033, 3528585145198628, 46753753173881822, 658243630211230916, 9215410822957232825, 197209791611284782456, 2112570763708981231112 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(1) = 1; a(n+1) = Sum_{k=1..n} lcm(a(k),a(n))/a(k).
EXAMPLE
a(1) = 1;
a(2) = a(1)/gcd(a(1),a(1)) = 1/gcd(1,1) = 1;
a(3) = a(2)/gcd(a(1),a(2)) + a(2)/gcd(a(2),a(2)) = 1/gcd(1,1) + 1/gcd(1,1) = 2;
a(4) = a(3)/gcd(a(1),a(3)) + a(3)/gcd(a(2),a(3)) + a(3)/gcd(a(3),a(3)) = 2/gcd(1,2) + 2/gcd(1,2) + 2/gcd(2,2) = 5, etc.
MAPLE
A[1]:= 1:
for n from 1 to 50 do
A[n+1]:= add(A[n]/igcd(A[k], A[n]), k=1..n)
od:
seq(A[i], i=1..50); # Robert Israel, Sep 01 2017
MATHEMATICA
a[1] = 1; a[n_] := a[n] = Sum[a[n - 1]/GCD[a[k - 1], a[n - 1]], {k, 2, n}]; Table[a[n], {n, 26}]
a[1] = 1; a[n_] := a[n] = Sum[LCM[a[k - 1], a[n - 1]]/a[k - 1], {k, 2, n}]; Table[a[n], {n, 26}]
CROSSREFS
Sequence in context: A157612 A348103 A184943 * A184596 A149978 A212263
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Aug 31 2017
STATUS
approved

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 March 28 14:21 EDT 2024. Contains 371254 sequences. (Running on oeis4.)