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!)
A070335 a(n) = 2^n mod 23. 4

%I #28 Dec 18 2023 14:32:23

%S 1,2,4,8,16,9,18,13,3,6,12,1,2,4,8,16,9,18,13,3,6,12,1,2,4,8,16,9,18,

%T 13,3,6,12,1,2,4,8,16,9,18,13,3,6,12,1,2,4,8,16,9,18,13,3,6,12,1,2,4,

%U 8,16,9,18,13,3,6,12,1,2,4,8,16,9,18,13,3,6,12,1,2,4

%N a(n) = 2^n mod 23.

%H G. C. Greubel, <a href="/A070335/b070335.txt">Table of n, a(n) for n = 0..1000</a>

%H <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

%F From _R. J. Mathar_, Apr 13 2010: (Start)

%F a(n) = a(n-11).

%F G.f.: (1 + 2*x + 4*x^2 + 8*x^3 + 16*x^4 + 9*x^5 + 18*x^6 + 13*x^7 + 3*x^8 + 6*x^9 + 12*x^10)/ ((1-x) * (1 + x + x^2 + x^3 + x^4 + x^5 + x^6 + x^7 + x^8 + x^9 + x^10)). (End)

%p A070335 := proc(n) op(1+(n mod 11),[1,2,4,8,16,9,18,13,3,6,12]) ; end proc: # _R. J. Mathar_, Feb 05 2011

%t PowerMod[2, Range[0, 50], 23] (* _G. C. Greubel_, Mar 13 2016 *)

%o (Sage) [power_mod(2,n,23) for n in range(0,80)] # _Zerinvary Lajos_, Nov 03 2009

%o (PARI) a(n)=lift(Mod(2,23)^n) \\ _Charles R Greathouse IV_, Apr 06 2016

%o (GAP) a:=List([0..70],n->PowerMod(2,n,23));; Print(a); # _Muniru A Asiru_, Jan 26 2019

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_, May 12 2002

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 April 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)