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.

A096923 Numbers n for which there are exactly two k such that n = k + (product of nonzero digits of k).

This page as a plain text file.
%I A096923 #4 Nov 05 2013 12:03:44
%S A096923 12,14,16,18,22,26,38,44,50,55,62,66,74,80,86,88,98,104,112,114,120,
%T A096923 122,123,138,142,144,155,160,162,166,170,174,186,188,198,209,210,212,
%U A096923 218,224,230,237,240,250,258,261,265,285,286,294,303,308,314,316,326,327
%N A096923 Numbers n for which there are exactly two k such that n = k + (product of nonzero digits of k).
%e A096923 18 and 22 are the only two k such that k + (product of nonzero digits of k) = 26, hence 26 is a term.
%t A096923 knzd[n_]:=n+Times@@Select[IntegerDigits[n],#!=0&]; Sort[Transpose[ Select[ Tally[ Array[ knzd,400]],Last[#]==2&]][[1]]] (* _Harvey P. Dale_, Nov 05 2013 *)
%o A096923 (PARI) {c=2;z=330;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,",")))} \\for function addpnd see A096922
%Y A096923 Cf. A063114, A096347, A096922, A096924 - A096931.
%K A096923 nonn,base
%O A096923 1,1
%A A096923 _Klaus Brockhaus_, Jul 15 2004