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.

A368195 a(n) is the number of numbers that can be obtained by replacing any positive number without leading zeros, say m, appearing in the decimal expansion of n by one of the divisors of m.

This page as a plain text file.
%I A368195 #14 Dec 22 2023 11:39:35
%S A368195 1,2,2,3,2,4,2,4,3,4,2,7,3,6,5,8,3,9,4,6,5,6,4,11,5,8,6,10,5,8,3,8,6,
%T A368195 7,6,13,4,8,7,8,4,11,5,10,8,9,5,15,7,6,5,8,4,11,6,12,6,8,5,12,5,8,10,
%U A368195 12,8,14,6,12,9,8,3,13,4,7,7,10,6,12,5,10,8
%N A368195 a(n) is the number of numbers that can be obtained by replacing any positive number without leading zeros, say m, appearing in the decimal expansion of n by one of the divisors of m.
%C A368195 a(n) gives the number of terms in the n-th row of A368194.
%H A368195 Rémy Sigrist, <a href="/A368195/b368195.txt">Table of n, a(n) for n = 1..10000</a>
%H A368195 Rémy Sigrist, <a href="/A368195/a368195.gp.txt">PARI program</a>
%H A368195 <a href="/index/De#decimal_expansion">Index entries for sequences related to decimal expansion of n</a>
%F A368195 a(n) >= A000005(n).
%e A368195 For n = 42: the 42nd row of A368194 contains 11 terms (1, 2, 3, 6, 7, 12, 14, 21, 22, 41, 42), so a(42) = 11.
%o A368195 (PARI) See Links section.
%Y A368195 Cf. A000005, A368194, A368314 (binary variant).
%K A368195 nonn,base
%O A368195 1,2
%A A368195 _Rémy Sigrist_, Dec 16 2023