Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086362
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086362 a(n)=A085956[3n+1]. +0
5
5, 17, 239, 41, 131, 1889, 419, 89, 101, 113, 2543, 2789, 149, 881, 173, 9293, 491, 14249, 3191, 1973, 3539, 21377, 7103, 281, 5987, 38153, 317, 2789, 6971, 353, 214943, 42677, 3299, 11801, 2267, 27773, 29867, 10529, 461, 1181, 2663, 129209 (list; graph; listen)
OFFSET

0,1

COMMENT

A086361 and A086362 includes most probably the solvable [or small?] cases of A085956, where n=3k-1 has probably only two solutions, at [k,n,a(n)]=[1,2,13] and at [2,5,31].

EXAMPLE

n=50:3n+1=151,6n+2=302, a(50)=93923 prime with (93922-1)/302=311, prime and with 302.93923+1=28364747 prime; so the {311,93923,28364747} "generalized [short] Cunningham-chain" is defined.

CROSSREFS

Cf. A085956, A086361.

Sequence in context: A096407 A062230 A103920 this_sequence A089894 A077718 A093428

Adjacent sequences: A086359 A086360 A086361 this_sequence A086363 A086364 A086365

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 22 2003

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 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research