This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A048177 Primes p = d_1 d_2 ... d_k in base 10 such that for some base b, p = Sum_{i = 1..k} b^d_i. 1
 101, 1033, 101111, 1010203, 11111101, 101001001, 111010111, 1110011101, 1110110011 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Next term is greater than 3000000000. - Sam Handler (sam_5_5_5_0(AT)yahoo.com), Aug 17 2006 LINKS C. Rivera, Source EXAMPLE 101=50^1+50^0+50^1 MATHEMATICA isValid[n_]:= Module[{digits, b, totalSum, dcount}, If[ !PrimeQ[n], Return[False]]; digits=IntegerDigits[n]; dcount=DigitCount[n]; If[Total[dcount[[{2, 3, 4, 5, 6, 7, 8, 9}]]]==0, dcount=DigitCount[n]; If[Mod[n-dcount[[10]], dcount[[1]]]==0, Return[True], Return[False]]; ]; b=0; totalSum=0; While[totalSum

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 23 19:33 EDT 2019. Contains 325263 sequences. (Running on oeis4.)