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!)
A248794 a(n) = the smallest number k for which the sum of digits (A007953(k)) and the product of digits (A007954(k)) are both equal to highly composite numbers A002473, i.e., numbers whose prime divisors are all <= 7. 2

%I #8 Sep 08 2022 08:46:10

%S 1,2,3,4,5,6,7,8,9,11125,111126,1111127,111111135,11111128,111111129,

%T 1111111111145,1111111111137,111111111111138,11111111111111155,

%U 11111111111111139,1111111111111111147,111111111111111111156,1111111111111111111148,1111111111111111111111157

%N a(n) = the smallest number k for which the sum of digits (A007953(k)) and the product of digits (A007954(k)) are both equal to highly composite numbers A002473, i.e., numbers whose prime divisors are all <= 7.

%C See comment in A034710 (positive numbers for which the sum of digits equals the product of digits).

%e For n = 11; a(11) = 111126 because A002473(11) = 12, A007953(111126) = A007954(111126) = 12.

%o (Magma) A248794:=func<n|exists(r){k:k in[1..10^n] | &*Intseq(k) eq &+Intseq(k) and &*Intseq(k) eq n}select r else 0>; [A248794(n):n in[A002473(n)]]

%Y Cf. A002473, A034710, A007953, A007954.

%K nonn,base

%O 1,2

%A _Jaroslav Krizek_, Nov 02 2014

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 July 14 20:47 EDT 2024. Contains 374323 sequences. (Running on oeis4.)