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!)
A082798 Smallest multiple of n beginning with 8. 7
8, 8, 81, 8, 80, 84, 84, 8, 81, 80, 88, 84, 806, 84, 810, 80, 85, 810, 817, 80, 84, 88, 805, 816, 800, 806, 81, 84, 87, 810, 806, 800, 825, 816, 805, 828, 814, 836, 819, 80, 82, 84, 86, 88, 810, 828, 846, 816, 833, 800, 816, 832, 848, 810, 825, 840, 855, 812 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) is in {n, 2n, 3n, 4n, 5n, 6n, 7n, 8n, 9n, 11n, 12n, 13n, 14n, 15n, 16n, 17n, 18n, 21n, 22n, 23n, 24n, 25n, 26n, 27n, 31n, 32n, 33n, 34n, 35n, 36n, 41n, 42n, 43n, 44n, 45n, 51n, 52n, 53n, 54n, 61n, 62n, 63n, 71n, 72n}. [Charles R Greathouse IV, Mar 06 2011]
LINKS
MATHEMATICA
f[n_] := Block[{m = n}, While[ First@ IntegerDigits@ m != 8, m += n]; m]; Array[f, 55] (* Robert G. Wilson v *)
PROG
(PARI) a(n)=forstep(k=n, 72*n, n, if(Vec(Str(k))[1]=="8", return(k))) \\ Charles R Greathouse IV, Mar 06 2011
(Haskell)
a082798 n = until ((== 8) . a000030) (+ n) n
-- Reinhard Zumkeller, Mar 27 2012
(Python)
def a(n):
m = n
while str(m)[0] != '8': m += n
return m
print([a(n) for n in range(1, 59)]) # Michael S. Branicky, Aug 08 2021
CROSSREFS
Cf. A000030.
Sequence in context: A117861 A186984 A298962 * A286068 A228071 A192386
KEYWORD
base,easy,nonn
AUTHOR
Amarnath Murthy, Apr 20 2003
EXTENSIONS
Corrected and extended by Sean A. Irvine, Mar 06 2011
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 September 2 17:05 EDT 2024. Contains 375614 sequences. (Running on oeis4.)