Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096922
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A096922
%S A096922 2,4,6,8,10,11,20,23,24,28,29,32,33,34,35,41,42,45,46,47,54,56,58,60,65,
%T A096922 67,68,70,75,77,78,81,85,89,92,94,95,99,100,101,106,107,108,109,111,124,
%U A096922 125,128,129,130,132,133,135,140,141,143,145,146,147,152,154,156,158
%N A096922 Numbers n for which there is a unique k such that n = k + (product of 
               nonzero digits of k).
%e A096922 21 is the unique k such that k + (product of nonzero digits of k) = 23, 
               hence 23 is a term.
%t A096922 f[n_] := Block[{s = Sort[ IntegerDigits[n]]}, While[ s[[1]] == 0, s = 
               Drop[s, 1]]; n + Times @@ s]; t = Table[0, {200}]; Do[ a = f[n]; 
               If[a < 200, t[[a]]++ ], {n, 200}]; Select[ Range[ 200], t[[ # ]] 
               == 1 &] (from Robert G. Wilson v Jul 16 2004)
%o A096922 (PARI) addpnd(n)=local(k,s,d);k=n;s=1;while(k>0,d=divrem(k,10);k=d[1];
               s=s*max(1,d[2]));n+s
%o A096922 {c=1;z=160;v=vector(z);for(n=1,z+1,k=addpnd(n);if(k<=z,v[k]=v[k]+1));
               for(j=1,length(v),if(v[j]==c,print1(j,",")))}
%Y A096922 Cf. A063114, A096347, A063425, A096922, A096923, A096924, A096925, A096926, 
               A096927, A096928, A096929, A096930, A096931.
%Y A096922 Sequence in context: A067030 A072427 A050420 this_sequence A055954 A161602 
               A055956
%Y A096922 Adjacent sequences: A096919 A096920 A096921 this_sequence A096923 A096924 
               A096925
%K A096922 nonn,base
%O A096922 1,1
%A A096922 Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jul 15 2004

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research