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.

Showing 1-4 of 4 results.

A060683 Numbers for which the differences between consecutive divisors (ordered by size) are distinct.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 16, 17, 19, 21, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 41, 43, 44, 46, 47, 49, 50, 51, 52, 53, 55, 57, 58, 59, 61, 62, 64, 65, 67, 68, 69, 71, 73, 74, 76, 77, 79, 81, 82, 83, 85, 86, 87, 88, 89, 92, 93, 94, 95, 97, 98
Offset: 1

Views

Author

Labos Elemer, Apr 19 2001

Keywords

Comments

A060682(a(n)) = A000005(a(n)) - 1, n > 1. - Reinhard Zumkeller, Jun 25 2015

Examples

			For n=6, divisors={1,2,3,6}; differences={1,1,3}, which are not distinct, so 6 is not in the sequence.

Links

Crossrefs

Cf. A000005, A060680, A060681, A060682, A060765.
Cf. A060682, A259366 (complement).

Programs

  • Haskell
    a060683 n = a060683_list !! (n-1)
a060683_list = 1 : filter (\x -> a060682 x == a000005' x - 1) [2..]
-- Reinhard Zumkeller, Jun 25 2015
  • Mathematica
    test[n_ ] := Length[dd=Drop[d=Divisors[n], 1]-Drop[d, -1]]==Length[Union[dd]]; Select[Range[1, 100], test]
  • PARI
    isok(k) = my(d=divisors(k)); #Set(vector(#d-1, k, d[k+1]-d[k])) == #d-1; \\ Michel Marcus, Nov 11 2023

Extensions

Edited by Dean Hickerson, Jan 22 2002

A298045 Integers equal to the least common multiple of the set of numbers generated by all the differences between their consecutive divisors, taken in increasing order.

Original entry on oeis.org

1, 60, 300, 504, 1500, 1512, 3528, 3660, 4536, 7500, 12240, 13608, 24696, 36720, 37500, 40824, 122472, 172872, 187500, 208080, 223260, 367416, 937500, 1102248, 1210104, 3306744, 3537360, 4687500, 8470728, 9920232, 12450312, 13618860, 23437500, 29760696
Offset: 1

Views

Author

Paolo P. Lava, Jan 11 2018

Keywords

Comments

Subset of A060765.
Fixed points of A060766.
Many terms m > 1 have omega(m) = 3 or 4, 60 and 3660 being the smallest of both, respectively. Is there a term with omega(m) = 5? - Michael De Vlieger, Jan 13 2018
The first two terms with 5 prime divisors are 149829840 and 1348395120. The sequence is infinite since it contains all the numbers of the form 72*7^k, for k>0. - Giovanni Resta, Jan 15 2018

Examples

			Divisors of 504 are 1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 18, 21, 24, 28, 36, 42, 56, 63, 72, 84, 126, 168, 252 and 504.
Differences are: 2 - 1 = 1, 3 - 2 = 1, 4 - 3 = 1, 6 - 4 = 2, 7 - 6 = 1, 8 - 7 = 1, 9 - 8 = 1, 12 - 9 = 3, 14 - 12 = 2, 18 - 14 = 4, 21 - 18 = 3, 24 - 21 = 3, 28 - 24 = 4, 36 - 28 = 8, 42 - 36 = 6, 56 - 42 = 14, 63 - 56 = 7, 72 - 63 = 9, 84 - 72 = 12, 126 - 84 = 42, 168 - 126 = 42, 252 - 168 = 84, 504 - 252 = 252.
lcm(1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 42, 84, 252) is 504 again.

Links

Crossrefs

Cf. A060765, A060766.

Programs

  • Maple
    with(numtheory): P:=proc(q) local a,k,n; for n from 1 to q do a:=sort([op(divisors(n))]);
if n=lcm(op([seq(a[k+1]-a[k],k=1..nops(a)-1)])) then print(n); fi; od; end: P(10^6);
  • Mathematica
    {1}~Join~Select[Range[2, 10^6], LCM @@ Differences@ Divisors@ # == # &] (* Michael De Vlieger, Jan 13 2018 *)

Extensions

More terms from Michael De Vlieger, Jan 13 2018
a(31)-a(34) from Giovanni Resta, Jan 15 2018

A331828 Numbers k such that the divisors of k form an addition chain.

Original entry on oeis.org

1, 2, 4, 6, 8, 12, 16, 18, 20, 24, 30, 32, 36, 40, 42, 48, 54, 60, 64, 72, 80, 84, 90, 96, 100, 108, 120, 126, 128, 140, 144, 150, 156, 160, 162, 168, 180, 192, 198, 200, 210, 216, 220, 240, 252, 256, 264, 270, 272, 280, 288, 294, 300, 312, 320, 324, 330, 336, 342, 360
Offset: 1

Views

Author

Zizheng Fang, Jan 27 2020

Keywords

Comments

Every divisor of a term, except 1, can be expressed as the sum of two other divisors.
This sequence is a subsequence of A308115. Numbers that are in A308115 but not in this sequence include 462, 1300, 3234, etc.

Examples

			1: divisors -- 1;
2: divisors -- 1, 2 = 1 + 1;
4: divisors -- 1, 2 = 1 + 1, 4 = 2 + 2;
6: divisors -- 1, 2 = 1 + 1, 3 = 1 + 2, 6 = 3 + 3;
8: divisors -- 1, 2 = 1 + 1, 4 = 2 + 2, 8 = 4 + 4;
12: divisors -- 1, 2 = 1 + 1, 3 = 1 + 2, 4 = 1 + 3, 6 = 2 + 4, 12 = 6 + 6.

Links

Crossrefs

Subsequence of A308115.
Supersequence of A060765.

Programs

  • Maple
    q:= n-> (s-> andmap(x-> x=1 or ormap(y-> yAlois P. Heinz, Jan 30 2020
  • PARI
    isokd(k, d) = {for (j=1, k-1, if (vecsearch(d, d[k] - d[j]), return (1));); return (0);}
isok(k) = {my(d=divisors(k)); for (j=2, #d, if (! isokd(j, d), return(0));); return (1);} \\ Michel Marcus, Jan 30 2020

A060700 "Anomalous" numbers k such that for even numbers 2k, gcd(2k, lcm(dd(2k)))=2k and not k, where dd(2k) is the first difference set of divisors of 2k.

Original entry on oeis.org

15, 30, 35, 45, 63, 70, 75, 77, 91, 99, 105, 117, 126, 135, 140, 143, 150, 153, 154, 165, 175, 182, 187, 189, 195, 198, 209, 221, 225, 231, 234, 245, 247, 252, 255, 273, 280, 285, 286, 297, 299, 306, 308, 315, 323, 325, 330, 345, 350, 351, 357, 364, 374, 375
Offset: 1

Views

Author

Labos Elemer, Apr 25 2001

Keywords

Examples

			63 is here because for 126 = 2*63, lcm(dd(126)) = lcm(1, 1, 3, 1, 2, 5, 4, 3, 21, 21, 63) = 1260, so gcd(126, lcm(dd(126))) = gcd(126, 1260) = 126.

Crossrefs

Cf. A060680, A060681, A060682, A060683, A060684, A060685, A060741, A060742, A060763, A060764, A060765, A060766, A000005.

Programs

  • PARI
    f(n) = {my(d = divisors(n), dd = vector(#d-1, k, d[k+1] - d[k])); gcd(n, lcm(dd));}
isok(n) = (f(2*n) == 2*n); \\ Michel Marcus, Mar 29 2018
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.