Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099068
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099068 Numbers n such that n=P(d_1)*P(d_2)*...*P(d_k)+(P(d_1)+P(d_2)+...+P(d_k)) where d_1 d_2 ... d_k is the decimal expansion of n and P(i) is the i-th prime. +0
3
23, 119, 428, 918, 1637682 (list; graph; listen)
OFFSET

1,1

COMMENT

There is no other term up to 15000000.

LINKS

C. Rivera, Puzzle 279The Prime Puzzles & Problems connection.

EXAMPLE

1637682 is in the sequence because 1637682=

P(1)*P(6)*P(3)*P(7)*P(6)*P(8)*P(2)+(P(1)+P(6)+P(3)+P(7)+P(6)+P(8)+P(2)).

MATHEMATICA

Do[h=IntegerDigits[n]; l=Length[h]; If[ !MemberQ[h, 0]&&n==Product[Prime[h[[k]]], {k, l}]+Sum[Prime[h[[k]]], {k, l}], Print[n]], {n, 15000000}]

CROSSREFS

Cf. A099067, A099069, A097223, A097227.

Sequence in context: A042026 A042028 A069756 this_sequence A044355 A044736 A033211

Adjacent sequences: A099065 A099066 A099067 this_sequence A099069 A099070 A099071

KEYWORD

base,more,nonn

AUTHOR

Farideh Firoozbakht (baran4560(AT)yahoo.com), Oct 29 2004

EXTENSIONS

Definition corrected by D. S. McNeil, Mar 14 2009

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