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.

A099067 Numbers n such that n=P(d_1*d_2*...*d_k) + P(d_1+d_2+...+d_k) where d_1 d_2 ... d_k is the decimal expansion of n and P(i) is the i-th prime.

This page as a plain text file.
%I A099067 #4 Mar 30 2012 17:37:42
%S A099067 82,92,194,149868
%N A099067 Numbers n such that n=P(d_1*d_2*...*d_k) + P(d_1+d_2+...+d_k) where d_1 d_2 ... d_k is the decimal expansion of n and P(i) is the i-th prime.
%C A099067 All terms of this sequence are even. Next term (if it exists) is greater than 25000000.
%e A099067 149868 is in the sequence because 149868=149717+151=P(1*4*9*8*6*8)+P(1+4+9+8+6+8).
%t A099067 Do[h=IntegerDigits[n];l=Length[h];If[ !MemberQ[h, 0]&& n==Prime[Product[h[[k]], {k, l}]]+Prime[Sum[h[[k]], {k, l}]], Print[n]], {n, 25000000}]
%Y A099067 Cf. A099068, A099069.
%K A099067 base,more,nonn
%O A099067 1,1
%A A099067 _Farideh Firoozbakht_, Oct 08 2004