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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A182940 List of divisors of the sequence A094348 in their order of occurrence. 1

%I

%S 1,2,4,3,6,12,8,24,9,18,36,16,48,5,10,15,20,30,60,72,40,120,45,90,180,

%T 80,240,360,7,14,21,28,35,42,70,84,105,140,210,420,144,720,56,168,280,

%U 840

%N List of divisors of the sequence A094348 in their order of occurrence.

%C Read A094348 term-by-term, compute the divisors of each term, write down any divisors not seen before.

%e 1 [1]

%e 2 [2]

%e 4 [4]

%e 6 [3, 6]

%e 12 [12]

%e 24 [8, 24]

%e 36 [9, 18, 36]

%e 48 [16, 48]

%e 60 [5, 10, 15, 20, 30, 60]

%e 72 [72]

%e 120 [40, 120]

%e 180 [45, 90, 180]

%e 240 [80, 240]

%e 360 [360]

%e 420 [7, 14, 21, 28, 35, 42, 70, 84, 105, 140, 210, 420]

%e 720 [144, 720]

%e 840 [56, 168, 280, 840]

%e 1260 [63, 126, 252, 315, 630, 1260]

%e 1680 [112, 336, 560, 1680]

%e 2520 [504, 2520]

%e 5040 [1008, 5040]

%p concat := (a,h)->[op(a),op(sort(convert(h,list)))];

%p DivisorsInOrder := proc(S) local A, H, T, s;

%p T := {}; A := [];

%p for s in S do

%p H := numtheory[divisors](s) minus T:

%p if H <> {} then

%p A := concat(A, H);

%p T := T union H

%p fi

%p od;

%p A end:

%p A182940 := DivisorsInOrder(A094348);

%Y Cf. A094348, A096179.

%K nonn

%O 1,2

%A Peter Luschny, Jan 04 2011

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.

Last modified March 26 11:03 EDT 2023. Contains 361540 sequences. (Running on oeis4.)