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!)
A190940 Consider all compositions of n = a+b+c+..., as 2 or more positive integers a,b,c,... > 0. a(n) is the number of distinct values taken by lcm(a, a+b, a+b+c, ..., n). 1
0, 1, 2, 2, 6, 4, 12, 8, 16, 18, 48, 32, 96, 72, 64, 48, 240, 128, 480, 288, 320, 384, 960, 512 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
Conjecture: a(n) = A000005(A002944(n)), for n >= 2. - Ridouane Oudra, Aug 24 2019
EXAMPLE
Examples: for n=3 the a(3) = 2 distinct values are 3, 6. The compositions are 1+2, 2+1, and 1+1+1. The values of the lcm are lcm(1,1+2)=3, lcm(2,2+1)=6, and lcm(1,1+1,1+1+1)=6.
MAPLE
Lpsum := proc(L) local ps, k ; ps := [op(1, L)] ; for i from 2 to nops(L) do ps := [op(ps), op(-1, ps)+op(i, L)] ; end do: ps ; end proc:
A190940 := proc(n) local lc, k, c ; lc := {} ; for k from 2 to n do for c in combinat[composition](n, k) do lc := lc union { ilcm( op(Lpsum(c))) }; end do: end do: nops(lc) ; end proc: # R. J. Mathar, Jun 02 2011
MATHEMATICA
a[n_] := LCM @@@ (Accumulate /@ (Permutations /@ Rest[IntegerPartitions[n]] // Flatten[#, 1]&)) // Union // Length; Table[Print[an = a[n]]; an, {n, 1, 24}] (* Jean-François Alcover, Feb 27 2014 *)
CROSSREFS
Cf. A101207.
Sequence in context: A054585 A278236 A278226 * A336869 A046203 A321451
KEYWORD
nonn,more
AUTHOR
Naohiro Nomoto, May 24 2011
EXTENSIONS
a(12)-a(20) from R. J. Mathar, Jun 02 2011
a(21)-a(24) from Alois P. Heinz, Nov 03 2011
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 April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)