Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117388
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117388 a(n) is the smallest n-digit integer such if all numbers formed by inserting the exponentation symbol between any two digits are added up, the sum is prime. +0
3
21, 121, 1226, 14423, 111334 (list; graph; listen)
OFFSET

2,1

COMMENT

No zeros are allowed in the decimal representation of a(n).

EXAMPLE

a(5) = 14423 since 1^4423+14^423+144^23+1442^3 is prime.

MATHEMATICA

(* first do *) Needs["DiscreteMath`Combinatorica`"] (* then *) f[n_] := Block[{k = (10^n - 1)/9}, While[id = IntegerDigits@k; First@ Union@ id == 0 || !PrimeQ[Plus @@ Table[FromDigits@ Take[id, {1, k}]^FromDigits@ Take[id, {k + 1, n}], {k, n - 1}]], k++ ]; k]; Do[Print[f[n]] // Timing, {n, 2, 7}] - Robert G. Wilson v (rgwv(at)rgwv.com), Apr 27 2006

CROSSREFS

Cf. A113762.

Sequence in context: A074088 A044353 A044734 this_sequence A053052 A002299 A041852

Adjacent sequences: A117385 A117386 A117387 this_sequence A117389 A117390 A117391

KEYWORD

base,more,nonn

AUTHOR

Ray G. Opao (1260(AT)email.com), Apr 25 2006

EXTENSIONS

a(6) from Robert G. Wilson v (rgwv(at)rgwv.com) and Farideh Firoozbakht (mymontain(AT)yahoo.com), Apr 27 2006

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research