Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036237
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036237 a(n) = least k with 2^k mod k = k - n. +0
2
1, 2, 5, 4, 7, 10, 15, 8, 11, 14, 13, 28, 21, 78, 17, 16, 19, 22, 49, 42, 23, 26, 1577, 40, 33, 30, 29, 44, 31, 34, 39, 32, 65, 38, 37, 52, 115, 102, 41, 242, 43, 46, 51, 60, 47, 279, 395, 152, 57, 114, 53, 68, 85, 58, 63, 104, 59, 62, 61, 76, 69, 126, 5773, 64, 67, 1090 (list; graph; listen)
OFFSET

1,2

COMMENT

f(p-2) = p for p prime >= 5; f(2^k) = 2^k.

Is this the same as A015948? [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 20 2008]

CROSSREFS

Cf. A015910, A036236.

Sequence in context: A085801 A023843 A015948 this_sequence A119733 A111570 A057954

Adjacent sequences: A036234 A036235 A036236 this_sequence A036238 A036239 A036240

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research