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.

A334417 a(n) is the palindrome equal to A334416(n) divided by its sum of digits.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 2, 7, 4, 3, 4, 7, 5, 4, 6, 7, 8, 9, 7, 55, 22, 11, 55, 22, 55, 22, 55, 55, 33, 55, 55, 55, 55, 44, 55, 55, 55, 55, 505, 88, 66, 202, 262, 77, 121, 88, 99, 181, 151, 121, 101, 88, 505, 424, 181, 121, 151, 181, 131, 343, 202, 181, 141
Offset: 1

Views

Author

Bernard Schott, Apr 29 2020

Keywords

Examples

			A334416(10) = 12 whose sum of digits is 3; 12/3 = 4, so a(10) = 4.
		

Crossrefs

Cf. A334375 (similar for primes).

Programs

  • Mathematica
    Select[#/Plus @@ IntegerDigits[#] & /@ Range[3000], PalindromeQ] (* Amiram Eldar, Apr 29 2020 *)
  • PARI
    isok(m) = iferr(my(d=digits(m/sumdigits(m))); d==Vecrev(d), E, 0);
    apply(x->x/sumdigits(x), select(x->isok(x), [1..3000])) \\ Michel Marcus, Apr 29 2020

Formula

a(n) = A334416(n) / A007953(A334416(n)).

A334376 a(n) is the sum of digits of the n-th Moran number (A001101).

Original entry on oeis.org

9, 3, 9, 6, 9, 9, 12, 3, 6, 9, 7, 8, 9, 12, 9, 10, 15, 18, 3, 9, 11, 6, 12, 13, 9, 14, 15, 9, 10, 12, 21, 6, 11, 9, 12, 15, 13, 7, 12, 14, 9, 15, 18, 16, 9, 17, 15, 18, 9, 10, 12, 18, 18, 21, 9, 11, 12, 18, 24, 15, 18, 27, 3, 8, 9, 10, 15, 18, 3, 7, 9, 12, 16
Offset: 1

Views

Author

Rémy Sigrist, Apr 25 2020

Keywords

Examples

			For n = 42:
- A001101(42) = 555,
- A007953(555) = 15,
- hence a(42) = 15.
		

Crossrefs

Programs

  • PARI
    for (n=1, 1168, if (n%(s=sumdigits(n))==0 && isprime(n/s), print1 (s", ")))

Formula

a(n) = A007953(A001101(n)).
Showing 1-2 of 2 results.