Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096469
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096469 a(n)is the smallest number m such that the concatenation of n+1 numbers m^0, m^1,..., m^(n-1), m^n is a prime. +0
1
1, 3, 33, 23, 237, 93, 37, 291, 421, 7, 471, 213, 1941, 29, 43, 17, 327, 1, 523, 21, 3403, 1, 13281, 3851, 3583, 3081, 1681, 157, 34989, 5411, 2431, 1229, 4767, 1021, 8397, 603, 429, 561, 6571, 47, 8601, 347, 15027, 687, 1611, 273, 29979, 201, 5719 (list; graph; listen)
OFFSET

1,2

COMMENT

Conjecture: This sequence is infinite.

a(n)=1 iff n+1 is in the sequence A004023, so a(1)=a(18)=a(22)=a(316)=a(1030)=a(49080)=a(86452)=1 and there are no other n less than 86453 such that a(n)=1. Every term of this sequence is odd and for each n, 5 doesn't divide a(n). a(50) is greater than 11111.

EXAMPLE

a(3)=33 because 33^0=1; 33^1=33; 33^2=1089; 33^3=35937; 133108935937 is a prime and 33 is the smallest such number.

CROSSREFS

Cf. A096470, A096471, A004023.

Sequence in context: A129431 A054780 A134474 this_sequence A106423 A077328 A106413

Adjacent sequences: A096466 A096467 A096468 this_sequence A096470 A096471 A096472

KEYWORD

base,nonn

AUTHOR

Farideh Firoozbakht (mymontain(AT)yahoo.com), Jun 23 2004

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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research