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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A015943 (2^(2n)+n) mod (2n). 1

%I

%S 1,2,1,4,9,10,11,8,1,6,15,4,17,2,19,16,21,10,23,36,1,38,27,40,49,42,1,

%T 4,33,46,35,32,31,50,9,28,41,54,25,56,45,22,47,36,19,62,51,16,67,26,

%U 13,100,57,82,89,72,7,74,63,76,65,78,1,64,49,70,71,52,133,46,75

%N (2^(2n)+n) mod (2n).

%H T. D. Noe, <a href="/A015943/b015943.txt">Table of n, a(n) for n = 1..10000</a>

%t Table[Mod[PowerMod[2, 2*n, 2*n] + n, 2*n], {n, 100}] (* _T. D. Noe_, Aug 04 2011 *)

%K nonn

%O 1,2

%A _Robert G. Wilson v_

%E Definition clarified by R. J. Mathar, Aug 04 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 05:07 EDT 2019. Contains 328145 sequences. (Running on oeis4.)