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!)
A203565 Numbers that contain the product of any two adjacent digits as a substring. 11

%I #23 Jan 02 2023 12:30:48

%S 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,30,31,40,41,

%T 50,51,60,61,70,71,80,81,90,91,100,101,102,103,104,105,106,107,108,

%U 109,110,111,112,113,114,115,116,117,118,119,120,121,126,130,131,140,141,150,151

%N Numbers that contain the product of any two adjacent digits as a substring.

%C Inspired by the problem restricted to pandigital numbers suggested by E. Angelini (cf. link).

%C E. Angelini observes that up to a(86) this is the same as "Numbers that contain the product of (all) their digits as a substring" (cf. A227510 for the zeroless terms); then 212 is here but not there, and 236 is there and not here. - _M. F. Hasler_, Oct 14 2014

%H Jayanta Basu, <a href="/A203565/b203565.txt">Table of n, a(n) for n = 1..1000</a>

%H E. Angelini, <a href="http://list.seqfan.eu/oldermail/seqfan/2012-January/016213.html">10 different digits, 9 products</a>, seqfan list, Jan 03 2012.

%e Any number having no two adjacent digits larger than 1 is trivially in the sequence.

%e The smallest nontrivial example is the number 126, which is in the sequence since 1*2=2 and 2*6=12 are both substrings of "126".

%p filter:= proc(n)

%p local L,S,i;

%p S:= convert(n,string);

%p for i from 1 to length(S)-1 do

%p if StringTools:-Search(convert(parse(cat(S[i],"*",S[i+1])),string),S) = 0 then

%p return false

%p fi

%p od:

%p true

%p end proc:

%p select(filter, [$0..1000]); # _Robert Israel_, Oct 15 2014

%t d[n_] := IntegerDigits[n]; Select[Range[0, 151], And @@ Table[MemberQ[FromDigits /@ Partition[d[#], IntegerLength[k], 1], k], {k, Times @@@ Partition[d[#], 2, 1]}] &] (* _Jayanta Basu_, Aug 10 2013 *)

%o (PARI) has(n,m)={ my(p=10^#Str(m)); until( m>n\=10, n%p==m & return(1))}

%o is_A203565(n)={ my(d); for(i=2,#d=eval(Vec(Str(n))), has(n,d[i]*d[i-1]) | return);1 }

%o is_A203565(n)={ my(d=Vecsmall(Str(n))); for(i=2,#d, d[i]<50 & i++ & next; has(n,d[i-1]%48*(d[i]-48)) | return);1 } /* twice as fast */

%o for( n=0,999, is_A203565(n) & print1(n","))

%Y Cf. A203569 (digits are permutations of 0...n).

%Y Cf. also A203566, A198298, A236402, A236403, A236404.

%Y Cf. A227510 (product of all digits is a substring and > 0).

%K nonn,base

%O 1,3

%A _M. F. Hasler_, Jan 03 2012

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 March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)