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.
%I A254321 #18 Feb 06 2015 05:50:25 %S A254321 6,8,9,22,26,30,33,34,38,40,42,44,45,48,51,52,55,56,57,60,62,63,65,66, %T A254321 68,70,74,75,76,77,78,80,82,84,85,86,87,88,90,91,94,95,96,99,102,110, %U A254321 111,112,114,115,117,118,122,130,133,136,141,144,152,153,155,161 %N A254321 Hyper Wasteful numbers. %C A254321 The distinction between the Wasteful numbers (A046760) is that the distinct digits are counted only instead all digits. Hence the definition: %C A254321 Write n as product of primes raised to powers, let D(n) = total number of distinct digits in product representation (number of distinct digits in all the primes and number of distinct digits in all the exponents that are greater than 1) and nbd(n) = A043537(n) = number of distinct digits in n; sequence gives n such that D(n) > nbd(n). %e A254321 88 is in the sequence because 88 = 2 ^ 3 * 11 => D(88)=3 > nbd(88)=1. %t A254321 Cases[Range[400], n_ /; Length[Union[Flatten[IntegerDigits[FactorInteger[n] /. 1 -> Sequence[]]]]] > Length[IntegerDigits[n]]] %o A254321 (PARI) for(n=1,100,s=[];F=factor(n);for(i=1,#F[,1],s=concat(s,digits(F[i,1]));if(F[i,2]>1,s=concat(s,digits(F[i,2]))));if(#vecsort(digits(n),,8)<#vecsort(s,,8),print1(n,", "))) \\ _Derek Orr_, Jan 30 2015 %Y A254321 Cf. A043537, A046760, A046758, A046759, A254318, A254319. %K A254321 nonn,base %O A254321 1,1 %A A254321 _Michel Lagneau_, Jan 28 2015