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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A336669 a(n) is the number of n-digit terms in A336668 (assuming 0 has 0 digit). 2
1, 9, 25, 54, 93, 24, 192, 72, 464, 606, 40, 9, 302, 9, 88, 69, 464, 9, 1056, 9, 108, 117, 25, 9, 775, 24, 25, 606, 156, 9, 207, 9, 464, 54, 25, 87, 1166, 9, 25, 54, 479, 9, 255, 9, 93, 621, 25, 9, 775, 72, 40, 54, 93, 9, 1056, 24, 527, 54, 25, 9, 317, 9, 25 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

This sequence is bounded as the decimal representation of any term in A336668 is fully determined by at most 9 of its leading digits.

LINKS

Rémy Sigrist, Table of n, a(n) for n = 0..10000

Rémy Sigrist, PARI program for A336669

FORMULA

a(n) = 9 iff n is 11-rough (A008364).

a(k*n) >= a(n) for any n >= 0 and k > 0.

Apparently, when n > 0, a(n) = a(gcd(n, 2^3 * 3^2 * 5 * 7)).

EXAMPLE

For n = 2:

- let m be a two-digit term of A336668 (10 <= m <= 99),

- if m starts with an odd digit, say d = 1, 3, 5, 7 or 9, then m ends with d,

- if m starts with an even digit, say d = 2, 4, 6 or 8, then m ends with any even digit, say t = 0, 2, 4, 6 or 8,

- so a(2) = 5 + 4*5 = 25.

PROG

(PARI) See Links section.

CROSSREFS

Cf. A008364, A336668.

Sequence in context: A031162 A348232 A147160 * A239745 A269440 A234038

Adjacent sequences: A336666 A336667 A336668 * A336670 A336671 A336672

KEYWORD

nonn,base

AUTHOR

Rémy Sigrist, Jul 29 2020

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 November 29 18:13 EST 2022. Contains 358431 sequences. (Running on oeis4.)