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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A168430 a(n) = 4^n mod 13. 2
1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10, 1, 4, 3, 12, 9, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (1, 0, -1, 1).

FORMULA

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

a(n) = a(n-1) - a(n-3) + a(n-4).

G.f.: (1 + 3*x - x^2 + 10*x^3)/ ((1-x) * (1+x) * (x^2-x+1)). (End)

MATHEMATICA

PowerMod[4, Range[0, 100], 13] (* or *) PadRight[{}, 100, {1, 4, 3, 12, 9, 10}] (* Harvey P. Dale, Mar 15 2015 *)

PROG

(Sage) [power_mod(4, n, 13)for n in xrange(0, 90)] #

(PARI) a(n)=lift(Mod(4, 13)^n) \\ Charles R Greathouse IV, Mar 22 2016

(MAGMA) [Modexp(4, n, 13): n in [0..100]]; /* or */ &cat[[1, 4, 3, 12, 9, 10]^^20]; // Vincenzo Librandi, Jul 23 2016

CROSSREFS

Sequence in context: A271199 A055527 A055523 * A074324 A162766 A166552

Adjacent sequences:  A168427 A168428 A168429 * A168431 A168432 A168433

KEYWORD

nonn,easy

AUTHOR

Zerinvary Lajos, Nov 25 2009

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 November 11 18:50 EST 2019. Contains 329031 sequences. (Running on oeis4.)