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!)
A284324 Numbers n such that product of digits of n is a power of 8. 5

%I #12 Sep 08 2022 08:46:19

%S 1,8,11,18,24,42,81,88,111,118,124,142,181,188,214,222,241,248,284,

%T 412,421,428,444,482,811,818,824,842,881,888,1111,1118,1124,1142,1181,

%U 1188,1214,1222,1241,1248,1284,1412,1421,1428,1444,1482,1811,1818,1824,1842

%N Numbers n such that product of digits of n is a power of 8.

%C Supersequence of A213084.

%C There are (2 + 4^d)/3 terms with d digits, for each d >= 1. - _Robert Israel_, Mar 31 2017

%H Robert Israel, <a href="/A284324/b284324.txt">Table of n, a(n) for n = 1..10000</a>

%e 1111 is in the sequence because 1*1*1*1 = 1 = 8^0.

%p dmax:= 4: # to get all terms with at most dmax digits

%p B[0,1]:= {1,8}:

%p B[1,1]:= {2}:

%p B[2,1]:= {4}:

%p for d from 2 to dmax do

%p for j from 0 to 2 do

%p B[j,d]:= map(t -> (10*t+1,10*t+8), B[j,d-1])

%p union map(t -> 10*t+4, B[(j+1) mod 3, d-1])

%p union map(t->10*t+2, B[(j+2) mod 3, d-1])

%p od od:

%p seq(op(sort(convert(B[0,d],list))),d=1..dmax); # _Robert Israel_, Mar 31 2017

%o (Magma) Set(Sort([n: n in [1..10000], k in [0..20] | &*Intseq(n) eq 8^k]))

%Y Cf. Numbers n such that product of digits of n is a power of k for k = 0 - 9: A284375 (k = 0), A002275 (k = 1), A028846 (k = 2), A174813 (k = 3), A284323 (k = 4), A276037 (k = 5), A276038 (k = 6), A276039 (k = 7), this sequence (k = 8), A284295 (k = 9).

%K nonn,base

%O 1,2

%A _Jaroslav Krizek_, Mar 26 2017

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 April 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)