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-2 of 2 results.

A340637 Integers whose number of divisors that are Niven numbers sets a new record.

Original entry on oeis.org

1, 2, 4, 6, 12, 24, 36, 60, 72, 120, 180, 240, 360, 720, 1080, 1800, 2160, 2520, 4320, 5040, 7560, 10080, 15120, 20160, 25200, 30240, 45360, 50400, 60480, 75600, 90720, 100800, 110880, 120960, 151200, 166320, 221760, 277200, 302400, 332640, 453600, 498960, 554400
Offset: 1

Views

Author

Bernard Schott, Jan 14 2021

Keywords

Comments

A Niven number (A005349) is a number that is divisible by the sum of its digits.
The first 13 terms are the first 13 terms of A236021, then A236021(14) = 420 while a(14) = 720.

Examples

			The 8 divisors of 24 are all Niven numbers, and also, 24 is the smallest integer that has at least 8 divisors that are Niven numbers, hence 24 is a term.
		

Crossrefs

Subsequence of A333456.
Similar for palindromes (A093036), repdigits (A340548), repunits (A340549), Zuckerman numbers (A340638).

Programs

  • Mathematica
    s[n_] := DivisorSum[n, 1 &, Divisible[#, Plus @@ IntegerDigits[#]] &]; smax = 0; seq = {}; Do[s1 = s[n]; If[s1 > smax, smax = s1; AppendTo[seq, n]], {n, 1, 10^6}]; seq (* Amiram Eldar, Jan 14 2021 *)
  • PARI
    f(n) = sumdiv(n, d, !(d % sumdigits(d))); \\ A332268
    lista(nn) = {my(m=0); for (n=1, nn, my(x = f(n)); if (x > m, m = x; print1(n, ", ")););} \\ Michel Marcus, Jan 14 2021

Extensions

More terms from Amiram Eldar, Jan 14 2021

A340797 Integers whose number of divisors that are Brazilian sets a new record.

Original entry on oeis.org

1, 7, 14, 24, 40, 48, 60, 84, 120, 168, 240, 336, 360, 420, 672, 720, 840, 1260, 1680, 2520, 3360, 5040, 7560, 10080, 15120, 20160, 25200, 27720, 30240, 43680, 45360, 50400, 55440, 65520, 83160, 98280, 110880, 131040, 166320, 196560, 221760, 262080, 277200, 327600
Offset: 1

Views

Author

Bernard Schott, Jan 24 2021

Keywords

Comments

Corresponding number of Brazilian divisors: 0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 14, 15, 17, 18, 19, 26, ...
Observation: the 58 consecutive highly composite numbers from A002182(12) = 240 to A002182(69) = 2095133040 (maybe more, according to conjectured terms) are also terms of this sequence.

Examples

			40 has 8 divisors: {1, 2, 4, 5, 8, 10, 20, 40} of which 4 are Brazilian: {8, 10, 20, 40}. No positive integer smaller than 40 has as many as four Brazilian divisors; hence 40 is a term.
		

Crossrefs

Similar with: A093036 (palindromes), A340548 (repdigits), A340549 (repunits), A340637 (Niven), A340638 (Zuckerman).

Programs

  • Mathematica
    brazQ[n_] := Module[{b = 2, found = False}, While[b < n - 1 && Length[Union[ IntegerDigits[n, b]]] > 1, b++]; b < n - 1]; d[n_] := DivisorSum[n, 1 &, brazQ[#] &]; dm = -1; s = {}; Do[d1 = d[n]; If[d1 > dm, dm = d1; AppendTo[s, n]], {n, 1, 1000}]; s (* Amiram Eldar, Jan 24 2021 *)
  • PARI
    isb(n) = for(b=2, n-2, d=digits(n, b); if(vecmin(d)==vecmax(d), return(1))); \\ A125134
    nbd(n) = sumdiv(n, d, isb(d)); \\ A340795
    lista(nn) = {my(m=-1); for (n=1, nn, my(x = nbd(n)); if (x > m, print1(n, ", "); m = x););} \\ Michel Marcus, Jan 24 2021

Extensions

a(20)-a(36) from Michel Marcus, Jan 24 2021
a(37)-a(44) from Amiram Eldar, Jan 24 2021
Showing 1-2 of 2 results.