login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A039739 a(n)=2q-p(n), where q is the prime < p(n) for which (p(n) mod q) is maximal. 0
1, 1, 3, 3, 1, 5, 3, 3, 5, 3, 1, 5, 3, 11, 5, 3, 1, 7, 3, 1, 3, 3, 5, 9, 5, 3, 11, 9, 5, 7, 3, 5, 3, 9, 7, 1, 3, 11, 5, 15, 13, 3, 1, 5, 3, 3, 3, 27, 25, 21, 15, 13, 3, 5, 11, 5, 3, 1, 17, 15, 5, 7, 3, 1, 9, 3, 9, 11, 9, 5, 3, 15, 9, 3, 3, 5, 1, 21, 13, 3, 1 (list; graph; refs; listen; history; internal format)
OFFSET

2,3

CROSSREFS

Sequence in context: A092674 A111945 A002143 * A160496 A105663 A021755

Adjacent sequences:  A039736 A039737 A039738 * A039740 A039741 A039742

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:57 EST 2012. Contains 206009 sequences.