cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A179976 a(n) = 2^(2n+1) mod (2n+1).

This page as a plain text file.
%I A179976 #14 Jul 21 2022 12:19:56
%S A179976 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 A179976 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 A179976 112,8,57,2,8,2,128,53,2,2,8,85,32,50,2,2,53,63,2,8,151
%N A179976 a(n) = 2^(2n+1) mod (2n+1).
%F A179976 a(n) = A015910(2n+1).
%e A179976 a(0) = (2^(2*0+1) mod (2*0+1))=(2 mod 1)=0.
%K A179976 nonn
%O A179976 0,2
%A A179976 _Juri-Stepan Gerasimov_, Jan 13 2011