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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A244357 Numbers n such that n, n+1, and n+2 are not divisible by any of their nonzero digits. 2
 56, 57, 67, 477, 506, 507, 556, 557, 577, 586, 587, 596, 597, 656, 657, 667, 668, 697, 757, 758, 778, 787, 788, 857, 858, 866, 867, 868, 877, 897, 956, 957, 976, 977, 978, 4077, 4097, 4457, 4477, 4497, 4657, 4677, 4757, 4857, 4897, 4997, 5056, 5057, 5066, 5067, 5077, 5096 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This is a subsequence of A244356. All numbers end in a 6, 7, or 8. LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 EXAMPLE 56, 57, and 58 are not divisible by their digits. Thus, 56 is a member of this sequence. MATHEMATICA SequencePosition[Table[If[NoneTrue[n/Select[IntegerDigits[n], #>0&], IntegerQ], 1, 0], {n, 5100}], {1, 1, 1}][[All, 1]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Mar 15 2018 *) PROG (Python) def a(n): ..for i in range(10**4): ....tot = 0 ....for k in range(i, i+n): ......c = 0 ......for b in str(k): ........if b != '0': ..........if k%int(b)!=0: ............c += 1 ......if c == len(str(k))-str(k).count('0'): ........tot += 1 ....if tot == n: ......print(i, end=', ') a(3) CROSSREFS Cf. A038772, A244356, A237766. Sequence in context: A262148 A008942 A133898 * A235377 A003897 A345493 Adjacent sequences: A244354 A244355 A244356 * A244358 A244359 A244360 KEYWORD nonn,base AUTHOR Derek Orr, Jun 26 2014 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.

Last modified June 23 08:01 EDT 2024. Contains 373629 sequences. (Running on oeis4.)