login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070335 a(n) = 2^n mod 23. 4
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, 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, 8, 16, 9, 18, 13, 3, 6, 12, 1, 2, 4, 8, 16, 9, 18, 13, 3, 6, 12, 1, 2, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

G. C. Greubel, Table of n, a(n) for n = 0..1000

FORMULA

From R. J. Mathar, Apr 13 2010: (Start)

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

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)

MAPLE

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

MATHEMATICA

PowerMod[2, Range[0, 50], 23] (* G. C. Greubel, Mar 13 2016 *)

PROG

(Sage) [power_mod(2, n, 23) for n in range(0, 80)] # Zerinvary Lajos, Nov 03 2009

(PARI) a(n)=lift(Mod(2, 23)^n) \\ Charles R Greathouse IV, Apr 06 2016

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

CROSSREFS

Sequence in context: A119318 A082953 A009289 * A277846 A277845 A277858

Adjacent sequences:  A070332 A070333 A070334 * A070336 A070337 A070338

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, May 12 2002

STATUS

approved

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 September 22 09:47 EDT 2021. Contains 347606 sequences. (Running on oeis4.)