Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A015948
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A015948
%S A015948 1,2,5,4,7,10,15,8,11,14,13,28,21,78,17,16,19,22,49,42,23,26,1577,40,
%T A015948 33,30,29,44,31,34,39,32,65,38,37,52,115,102,41,242,43,46,51,60,47,279,
%U A015948 395,152,57,114,53,68,85,58,63,104,59,62,61,76,69,126,5773,64,67,1090
%N A015948 a(n) = smallest k such that k | 2^k + n.
%C A015948 Equally, a(n) = smallest k with 2^k mod k = k - n.
%F A015948 a(p-2) = p for p prime >= 5; a(2^k) = 2^k. - David W. Wilson (davidwwilson(AT)comcast.net)
%Y A015948 Cf. A015910, A036236.
%Y A015948 Sequence in context: A153990 A154811 A036237 this_sequence A119733 A111570 
               A057954
%Y A015948 Adjacent sequences: A015945 A015946 A015947 this_sequence A015949 A015950 
               A015951
%K A015948 nonn
%O A015948 0,2
%A A015948 Robert G. Wilson v (rgwv(AT)rgwv.com)
%E A015948 Edited by N. J. A. Sloane (njas(AT)research.att.com), Jan 31 2009 at 
               the suggestion of R. J. Mathar and T. D. Noe.

    
page 1

Search completed in 0.004 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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research