Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A103964
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A103964 Incremental subsequence of A040076 such that every a(n)>a(n-1). +0
2
0, 1, 2, 3, 6, 8, 583, 6393 (list; graph; listen)
OFFSET

1,3

COMMENT

The index sequence of this sequence is 1, 3, 7, 17, 19, 31, 47, 383, 2897. A040076(2897)>8192, not yet found.

EXAMPLE

A040076(1)=0, so a(1)=0;

A040076(3)=1, so a(2)=1;

MATHEMATICA

k = -1; n = 0; km = k; While[k < 8192, n++; k = 0; cp = n*(2^ k) + 1; While[(! PrimeQ[cp]) && (k < 8192), k++; cp = n*(2^k) + 1]; If[k > km, km = k; Print[{n, km}]]]

CROSSREFS

Cf. A040076, A103963.

Sequence in context: A051934 A153915 A093705 this_sequence A088329 A087494 A021426

Adjacent sequences: A103961 A103962 A103963 this_sequence A103965 A103966 A103967

KEYWORD

nonn

AUTHOR

Lei Zhou (lzhou5(AT)emory.edu), Feb 24 2005

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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research