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

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070399 a(n) = 6^n mod 31. 1
1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25, 26, 1, 6, 5, 30, 25 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

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

FORMULA

a(n) = (1/15)*(78*(n mod 6)+13*((n+1) mod 6)+28*((n+2) mod 6)-47*((n+3) mod 6)+18*((n+4) mod 6)+3*((n+5) mod 6)). - Paolo P. Lava, Apr 16 2010

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

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

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

a(n) = a(n-6). - G. C. Greubel, Mar 18 2016

MATHEMATICA

PowerMod[6, Range[0, 50], 31] (* G. C. Greubel, Mar 18 2016 *)

PROG

(Sage) [power_mod(6, n, 31)for n in xrange(0, 83)] # Zerinvary Lajos, Nov 27 2009

(PARI) a(n) = lift(Mod(6, 31)^n); \\ Altug Alkan, Mar 18 2016

CROSSREFS

Sequence in context: A256961 A267743 A219931 * A137763 A029763 A283980

Adjacent sequences:  A070396 A070397 A070398 * A070400 A070401 A070402

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified May 25 14:13 EDT 2017. Contains 287038 sequences.