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.

User: Hani Samamah

Hani Samamah's wiki page.

Hani Samamah has authored 4 sequences.

A346563 a(n) = n + A007978(n).

Original entry on oeis.org

3, 5, 5, 7, 7, 10, 9, 11, 11, 13, 13, 17, 15, 17, 17, 19, 19, 22, 21, 23, 23, 25, 25, 29, 27, 29, 29, 31, 31, 34, 33, 35, 35, 37, 37, 41, 39, 41, 41, 43, 43, 46, 45, 47, 47, 49, 49, 53, 51, 53, 53, 55, 55, 58, 57, 59, 59, 61, 61, 67, 63, 65, 65, 67, 67
Offset: 1

Keywords

Comments

Beginning at n=3, a(n) represents the maximum length of consecutive numbers that are divisible by the product of their nonzero digits in base n. In particular, if n=10, the sequence of numbers that are divisible by the product of their nonzero digits is given by A055471.

Examples

			For n=6, the least non-divisor of 6 is 4, so a(6) = 6+4 = 10. As seen in the Comments section, 55980, 55981, ..., 55989 form a sequence of length 10, where every number is divisible by the product of its nonzero digits in base n=6. Work has been done to show that 10 is the maximum length for such sequences.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := Module[{k = 1}, While[Divisible[n, k], k++]; n + k]; Array[a, 100] (* Amiram Eldar, Jul 23 2021 *)
  • PARI
    a(n) = my(k=2); while(!(n % k), k++); n+k; \\ Michel Marcus, Jul 23 2021
  • Python
    goal = 100
    these = []
    n = 1
    while n <= goal:
        k = 1
        while n % k == 0:
            k = k + 1
        these.append(n + k)
        n += 1
    print(these)
    

Formula

a(2k+1) = 2k+3.
a(2k) >= 2k+3.

A346537 Squares that are divisible by the product of their nonzero digits.

Original entry on oeis.org

1, 4, 9, 36, 100, 144, 400, 900, 1024, 1296, 2304, 2500, 2916, 3600, 10000, 11664, 12100, 14400, 22500, 32400, 40000, 41616, 78400, 82944, 90000, 102400, 110224, 121104, 122500, 129600, 152100, 176400, 186624, 200704, 202500, 219024, 230400, 250000, 260100, 291600
Offset: 1

Keywords

Examples

			For the perfect square 1024 = 32^2 the product of its nonzero digits is 8 which divides 1024.
		

Crossrefs

Intersection of A000290 and A055471.

Programs

  • Mathematica
    Select[Range[500]^2, Divisible[#, Times @@ Select[IntegerDigits[#], #1 > 0 &]] &] (* Amiram Eldar, Jul 23 2021 *)
  • PARI
    isok(m) = issquare(m) && !(m % vecprod(select(x->(x>0), digits(m))));
    lista(nn) = for (m=1, nn, if (isok(m^2), print1(m^2, ", "))); \\ Michel Marcus, Jul 23 2021
  • Python
    from math import prod
    def nzpd(n): return prod([int(d) for d in str(n) if d != '0'])
    def ok(sqr): return sqr > 0 and sqr%nzpd(sqr) == 0
    print(list(filter(ok, (i*i for i in range(541))))) # Michael S. Branicky, Jul 23 2021
    

A339999 Squares that are divisible by both the sum of their digits and the product of their nonzero digits.

Original entry on oeis.org

1, 4, 9, 36, 100, 144, 400, 900, 1296, 2304, 2916, 3600, 10000, 11664, 12100, 14400, 22500, 32400, 40000, 41616, 82944, 90000, 121104, 122500, 129600, 152100, 176400, 186624, 202500, 219024, 230400, 260100, 291600, 360000, 419904, 435600, 504100
Offset: 1

Keywords

Examples

			For the perfect square 144 = 12^2, the sum of its digits is 9, which divides 144, and the product of its nonzero digits is 16, which also divides 144 so 144 is a term of the sequence.
		

Crossrefs

Intersection of A000290, A005349 and A055471.

Programs

  • Mathematica
    Select[Range[720]^2, And @@ Divisible[#, {Plus @@ (d = IntegerDigits[#]), Times @@ Select[d, #1 > 0 &]}] &] (* Amiram Eldar, Jul 23 2021 *)
  • Python
    from math import prod
    def sumd(n): return sum(map(int, str(n)))
    def nzpd(n): return prod([int(d) for d in str(n) if d != '0'])
    def ok(sqr): return sqr > 0 and sqr%sumd(sqr) == 0 and sqr%nzpd(sqr) == 0
    print(list(filter(ok, (i*i for i in range(1001)))))
    # Michael S. Branicky, Jul 23 2021

A346657 Numbers that are not divisible by the product of their nonzero digits.

Original entry on oeis.org

13, 14, 16, 17, 18, 19, 21, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 72, 73, 74, 75, 76, 77, 78, 79, 81, 82, 83, 84, 85, 86, 87
Offset: 1

Keywords

Examples

			The product of the nonzero digits of 42 is 4*2 = 8, which does not divide 42.
		

Crossrefs

Complement of A055471.

Programs

  • Mathematica
    Select[Range[100], !Divisible[#, Times @@ Select[IntegerDigits[#], #1 > 0 &]] &] (* Amiram Eldar, Jul 27 2021 *)
  • PARI
    isok(k) = k % vecprod(select(x->(x>0), digits(k))); \\ Michel Marcus, Jul 28 2021
  • Python
    from math import prod
    def ok(n): return n > 0 and n%prod([int(d) for d in str(n) if d != '0'])
    print(list(filter(ok, range(88)))) # Michael S. Branicky, Jul 27 2021