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.

A058901 Inconsummate numbers in base 5: no number is this multiple of the sum of its digits (in base 5).

Original entry on oeis.org

16, 22, 28, 46, 56, 58, 68, 74, 76, 80, 106, 108, 110, 118, 128, 136, 138, 140, 146, 152, 168, 198, 202, 206, 208, 230, 249, 256, 258, 262, 263, 268, 274, 276, 278, 280, 284, 286, 288, 290, 292, 294, 296, 298, 302, 318, 323, 324, 326, 336, 338
Offset: 1

Views

Author

N. J. A. Sloane, Jan 09 2001

Keywords

Crossrefs

Programs

  • Maple
    For Maple code see A058906.
  • Mathematica
    base=5; Do[k=n; While[Apply[Plus, IntegerDigits[k, base]] n!=k&&k<250n, k+=n]; If[k==250 n, Print[n]], {n, 1, 10^4}] (* Vincenzo Librandi, Nov 03 2016 *)
  • Python
    from itertools import count, islice, combinations_with_replacement
    from sympy.ntheory import digits
    def A058901_gen(startvalue=1): # generator of terms >= startvalue
        for n in count(max(startvalue,1)):
            for l in count(1):
                if 4*l*n < 5**(l-1):
                    yield n
                    break
                for d in combinations_with_replacement(range(5),l):
                    if (s:=sum(d)) > 0 and sorted(digits(s*n,5)[1:]) == list(d):
                        break
                else:
                    continue
                break
    A058901_list = list(islice(A058901_gen(),20)) # Chai Wah Wu, May 10 2023