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.

A274125 Numbers having digits in nondecreasing order and sum of digits greater than or equal to the product of digits.

This page as a plain text file.
%I A274125 #24 Jun 20 2016 08:50:40
%S A274125 1,2,3,4,5,6,7,8,9,11,12,13,14,15,16,17,18,19,22,111,112,113,114,115,
%T A274125 116,117,118,119,122,123,1111,1112,1113,1114,1115,1116,1117,1118,1119,
%U A274125 1122,1123,1124,11111,11112,11113,11114,11115,11116,11117,11118,11119,11122
%N A274125 Numbers having digits in nondecreasing order and sum of digits greater than or equal to the product of digits.
%C A274125 Intersection of A062996 and A009994. Permuting the digits of the terms of this sequence gives A254621. Permutations of digits can be found in A261370. The union of A254621 and A011540 is A062996.
%H A274125 David A. Corneth, <a href="/A274125/b274125.txt">Table of n, a(n) for n = 1..1000</a>
%t A274125 upto[nd_] := Sort[FromDigits /@ Reverse /@ Select[ Flatten[ IntegerPartitions[#, nd, Range@ 9] & /@ Range[9 nd], 1], Times @@ # <= Plus @@ # &]]; upto[8] (* _Giovanni Resta_, Jun 20 2016 *)
%o A274125 (PARI) is(n) = my(d=digits(n)); prod(i=1, #d, d[i]) <= vecsum(d) && vecsort(d) == d
%Y A274125 Cf. A062996, A009994.
%K A274125 nonn,base
%O A274125 1,2
%A A274125 _David A. Corneth_, Jun 10 2016