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.

A336876 a(n) is the least m such that A336826(n) = m*p(m) (where p(m) is the product of decimal digits of m).

This page as a plain text file.
%I A336876 #24 Aug 06 2020 16:02:44
%S A336876 0,1,2,3,11,4,12,5,6,13,21,7,14,8,15,9,22,31,16,111,17,23,18,41,19,24,
%T A336876 112,121,25,51,33,26,42,113,61,27,131,34,211,28,114,122,71,43,52,29,
%U A336876 35,141,115,36,116,44,123,62,151,37,132,53,91,212,221,45,38
%N A336876 a(n) is the least m such that A336826(n) = m*p(m) (where p(m) is the product of decimal digits of m).
%C A336876 Some terms of A336826 have several representations as the product of a number and of its decimal digits; for example 549504 has four such representations: 1696 * 1 * 6 * 9 * 6, 2862 * 2 * 8 * 6 * 2, 3392 * 3 * 3 * 9 * 2 and 3816 * 3 * 8 * 1 * 6.
%H A336876 Rémy Sigrist, <a href="/A336876/b336876.txt">Table of n, a(n) for n = 1..10000</a>
%H A336876 Rémy Sigrist, <a href="/A336876/a336876.txt">C program for A336876</a>
%F A336876 A098736(a(n)) = A336826(n).
%e A336876 For n = 26:
%e A336876 - A336826(26) = 192,
%e A336876 - the divisors d of 192, alongside d*p(d), are:
%e A336876   d    d*p(d)
%e A336876   ---  ------
%e A336876     1       1
%e A336876     2       4
%e A336876     3       9
%e A336876     4      16
%e A336876     6      36
%e A336876     8      64
%e A336876    12      24
%e A336876    16      96
%e A336876    24     192
%e A336876    32     192
%e A336876    48    1536
%e A336876    64    1536
%e A336876    96    5184
%e A336876   192    3456
%e A336876 - so a(26) = min(24, 32) = 24.
%o A336876 (C) See Links section.
%Y A336876 Cf. A007954, A098736, A336826, A336879.
%K A336876 nonn,look,base
%O A336876 1,3
%A A336876 _Rémy Sigrist_, Aug 06 2020