login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A179976 a(n) = 2^(2n+1) mod (2n+1). 4

%I #14 Jul 21 2022 12:19:56

%S 0,2,2,2,8,2,2,8,2,2,8,2,7,26,2,2,8,18,2,8,2,2,17,2,30,8,2,43,8,2,2,8,

%T 32,2,8,2,2,68,18,2,80,2,32,8,2,37,8,13,2,17,2,2,92,2,2,8,2,78,44,60,

%U 112,8,57,2,8,2,128,53,2,2,8,85,32,50,2,2,53,63,2,8,151

%N a(n) = 2^(2n+1) mod (2n+1).

%F a(n) = A015910(2n+1).

%e a(0) = (2^(2*0+1) mod (2*0+1))=(2 mod 1)=0.

%K nonn

%O 0,2

%A _Juri-Stepan Gerasimov_, Jan 13 2011

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 16 10:51 EDT 2024. Contains 374345 sequences. (Running on oeis4.)