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!)
A254501 a(n) is the smallest nonnegative integer such that a(n)! contains a string of exactly n consecutive 6's. 10

%I #38 Mar 21 2019 13:26:40

%S 0,3,20,38,35,213,1122,3415,10214,32430,145197,351679,666779,813843,

%T 3765934

%N a(n) is the smallest nonnegative integer such that a(n)! contains a string of exactly n consecutive 6's.

%e a(1) = 3 since 3! equals 6 and contains '6'.

%e a(2) = 20 since 20! contains '66' and 20 is the smallest integer for which the condition is met.

%t A254451[n_] := Module[{m = 0},

%t If[n == 0, While[MemberQ[IntegerDigits[m!], 6], m++]; m,

%t t = Table[6, n];

%t While[! MemberQ[Split[IntegerDigits[m!]], t], m++]; m]];

%t Table[A254451[n], {n, 0, 7}] (* _Robert Price_, Mar 21 2019 *)

%Y Cf. A254042, A254447, A254448, A254449, A254500, A254502, A254716, A254717.

%K nonn,base,more

%O 0,2

%A _Martin Y. Champel_, Jan 31 2015

%E a(10), a(11) from _Jon E. Schoenfield_, Feb 21 2015, Feb 23 2015

%E a(0) prepended by _Jon E. Schoenfield_, Mar 01 2015

%E a(12), a(13) from _Jon E. Schoenfield_, Mar 07 2015, Mar 10 2015

%E a(14) from _Bert Dobbelaere_, Oct 29 2018

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 August 13 18:29 EDT 2024. Contains 375144 sequences. (Running on oeis4.)