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!)
A369562 Smallest positive n-digit number divisible by 7. 0
7, 14, 105, 1001, 10003, 100002, 1000006, 10000004, 100000005, 1000000001, 10000000003, 100000000002, 1000000000006, 10000000000004, 100000000000005, 1000000000000001, 10000000000000003, 100000000000000002, 1000000000000000006, 10000000000000000004, 100000000000000000005 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The only semiprime terms are a(2) = 14 and a(n) such that (10^(n-1) + 3)/7 is a prime. - Jon E. Schoenfield, Jan 27 2024
LINKS
FORMULA
a(n) = (floor(10^(n-1)/7) + 1)*7.
a(n) = 10^(n-1) + A033940(n+2). - Amiram Eldar, Jan 27 2024
G.f.: 7*x*(1 - 9*x + 3*x^2 - x^3 - 3*x^4)/((1 - x)*(1 + x)*(1 - 10*x)*(1 - x + x^2)). - Stefano Spezia, Jan 28 2024
EXAMPLE
a(3) = 105 = 7*15.
MATHEMATICA
a[n_] := 10^(n - 1) + {6, 4, 5, 1, 3, 2}[[Mod[n, 6, 1]]]; Array[a, 30]
(* or *)
LinearRecurrence[{11, -10, -1, 11, -10}, {7, 14, 105, 1001, 10003, 100002}, 30] (* Amiram Eldar, Jan 27 2024 *)
CROSSREFS
Sequence in context: A196254 A173167 A143682 * A080451 A346534 A369122
KEYWORD
nonn,easy,base
AUTHOR
J. Lowell, Jan 25 2024
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 May 15 09:20 EDT 2024. Contains 372540 sequences. (Running on oeis4.)