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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070688 a(n) = n^6 mod 48. 0
 0, 1, 16, 9, 16, 25, 0, 1, 16, 33, 16, 25, 0, 25, 16, 33, 16, 1, 0, 25, 16, 9, 16, 1, 0, 1, 16, 9, 16, 25, 0, 1, 16, 33, 16, 25, 0, 25, 16, 33, 16, 1, 0, 25, 16, 9, 16, 1, 0, 1, 16, 9, 16, 25, 0, 1, 16, 33, 16, 25, 0, 25, 16, 33, 16, 1, 0, 25, 16, 9, 16, 1, 0, 1, 16, 9, 16, 25, 0, 1, 16 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,1,0,0,0,0,0,-1,0,0,0,0,0,1). FORMULA From Chai Wah Wu, Sep 02 2020: (Start) a(n) = a(n-6) - a(n-12) + a(n-18) for n > 17. G.f.: -x*(x^16 + 16*x^15 + 9*x^14 + 16*x^13 + 25*x^12 + 24*x^8 + 25*x^4 + 16*x^3 + 9*x^2 + 16*x + 1)/(x^18 - x^12 + x^6 - 1). (End) Period 24: repeat [0, 1, 16, 9, 16, 25, 0, 1, 16, 33, 16, 25, 0, 25, 16, 33, 16, 1, 0, 25, 16, 9, 16, 1]. - Alois P. Heinz, Sep 02 2020 PROG (PARI) a(n)=n^6%48 \\ Charles R Greathouse IV, Apr 06 2016 CROSSREFS Sequence in context: A302518 A070567 A257796 * A281719 A103167 A303317 Adjacent sequences:  A070685 A070686 A070687 * A070689 A070690 A070691 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, May 13 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.

Last modified September 24 07:34 EDT 2021. Contains 347623 sequences. (Running on oeis4.)