login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
0,3
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
MATHEMATICA
PowerMod[Range[0, 120], 6, 48] (* Harvey P. Dale, Dec 12 2023 *)
PROG
(PARI) a(n)=n^6%48 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A302518 A070567 A257796 * A281719 A103167 A303317
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 13 2002
STATUS
approved