The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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
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, 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, 12, 8, 14, 6, 12, 9, 8, 3, 13, 4, 7, 7, 10, 6, 12, 5, 10, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) gives the number of terms in the n-th row of A368194.
LINKS
Rémy Sigrist, PARI program
FORMULA
a(n) >= A000005(n).
EXAMPLE
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.
PROG
(PARI) See Links section.
CROSSREFS
Cf. A000005, A368194, A368314 (binary variant).
Sequence in context: A302051 A334080 A066800 * A218705 A193459 A114102
KEYWORD
nonn,base
AUTHOR
Rémy Sigrist, Dec 16 2023
STATUS
approved

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 June 8 03:10 EDT 2024. Contains 373207 sequences. (Running on oeis4.)