cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A182940 List of divisors of the sequence A094348 in their order of occurrence.

Original entry on oeis.org

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, 80, 240, 360, 7, 14, 21, 28, 35, 42, 70, 84, 105, 140, 210, 420, 144, 720, 56, 168, 280, 840
Offset: 1

Views

Author

Peter Luschny, Jan 04 2011

Keywords

Comments

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

Examples

			1    [1]
2    [2]
4    [4]
6    [3, 6]
12   [12]
24   [8, 24]
36   [9, 18, 36]
48   [16, 48]
60   [5, 10, 15, 20, 30, 60]
72   [72]
120  [40, 120]
180  [45, 90, 180]
240  [80, 240]
360  [360]
420  [7, 14, 21, 28, 35, 42, 70, 84, 105, 140, 210, 420]
720  [144, 720]
840  [56, 168, 280, 840]
1260 [63, 126, 252, 315, 630, 1260]
1680 [112, 336, 560, 1680]
2520 [504, 2520]
5040 [1008, 5040]
		

Crossrefs

Programs

  • Maple
    concat := (a,h)->[op(a),op(sort(convert(h,list)))];
    DivisorsInOrder := proc(S) local A, H, T, s;
    T := {}; A := [];
    for s in S do
       H := numtheory[divisors](s) minus T:
       if H <> {} then
          A := concat(A, H);
          T := T union H
       fi
    od;
    A end:
    A182940 := DivisorsInOrder(A094348);