cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A217491 Next largest positive integer without a digit 1 and not divisible by any digit of the preceding term.

This page as a plain text file.
%I A217491 #12 Jun 10 2016 00:21:00
%S A217491 2,3,4,5,6,7,8,9,20,23,25,27,29,33,34,35,37,38,43,46,47,50,52,53,56,
%T A217491 57,58,59,62,63,64,65,67,68,69,70,72,73,74,75,76,79,80,82,83,85,86,87,
%U A217491 89,92,93,94,95,96,97,200,203,205,207,209,223,227,229,233,235,239,245,247,249
%N A217491 Next largest positive integer without a digit 1 and not divisible by any digit of the preceding term.
%H A217491 E. Angelini, <a href="http://www.cetteadressecomportecinquantesignes.com/NotDivisible.htm">(n+1) is not divisible by any digit of n</a>, Oct 04 2012
%H A217491 E. Angelini, <a href="/A217489/a217489.pdf">(n+1) is not divisible by any digit of n</a> [Cached copy, with permission]
%o A217491 (PARI 2.6) A217491_vect(Nmax)={my(a=[],d=[0],L=0,nd); while( #a<Nmax, for( t=L+1,9e9, for(i=1+!d[1],#d, t%d[i] || next(2)); nd=Set(digits(t)); setsearch(nd,1) & next; a=concat(a,L=t); d=nd; break));a}
%Y A217491 A variant of A217489.
%Y A217491 Cf. A038603. - _Charles R Greathouse IV_, Oct 04 2012
%K A217491 nonn,base,easy
%O A217491 1,1
%A A217491 _M. F. Hasler_ and _Eric Angelini_, Oct 04 2012