login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 4

%I #14 Dec 22 2023 11:39:35

%S 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 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 12,8,14,6,12,9,8,3,13,4,7,7,10,6,12,5,10,8

%N 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 a(n) gives the number of terms in the n-th row of A368194.

%H Rémy Sigrist, <a href="/A368195/b368195.txt">Table of n, a(n) for n = 1..10000</a>

%H Rémy Sigrist, <a href="/A368195/a368195.gp.txt">PARI program</a>

%H <a href="/index/De#decimal_expansion">Index entries for sequences related to decimal expansion of n</a>

%F a(n) >= A000005(n).

%e 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 (PARI) See Links section.

%Y Cf. A000005, A368194, A368314 (binary variant).

%K nonn,base

%O 1,2

%A _Rémy Sigrist_, Dec 16 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 7 19:17 EDT 2024. Contains 374112 sequences. (Running on oeis4.)