Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A103963
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A103963 Incremental subsequence of A040081 such that every a(n)>a(n-1). +0
2
2, 3, 4, 7, 12, 23, 25, 2551 (list; graph; listen)
OFFSET

1,1

COMMENT

A040081(659) not yet found. The index sequence of this one is 1, 13, 23, 43, 59, 88, 127, 148, 659.

EXAMPLE

A040081(1)=2; A040081(13)=3; A040081(659)>8192

MATHEMATICA

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

CROSSREFS

Cf. A040081.

Sequence in context: A084972 A141002 A006537 this_sequence A006706 A124390 A107031

Adjacent sequences: A103960 A103961 A103962 this_sequence A103964 A103965 A103966

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research