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”).

A103948
a(n) is the number of distinct n-th powers of functions {1, 2, 3} -> {1, 2, 3}.
3
1, 27, 12, 19, 12, 21, 10, 21, 12, 19, 12, 21, 10, 21, 12, 19, 12, 21, 10, 21, 12, 19, 12, 21, 10, 21, 12, 19, 12, 21, 10, 21, 12, 19, 12, 21, 10, 21, 12, 19, 12, 21, 10, 21, 12, 19, 12, 21, 10, 21, 12, 19, 12, 21, 10, 21, 12, 19, 12, 21, 10, 21, 12, 19, 12, 21, 10, 21, 12, 19
OFFSET
0,2
FORMULA
For n > 1, a(n) = a(n+6).
G.f.: (6*x^5-3*x^4-30*x^3-39*x^2-28*x-1) / ((x-1)*(x+1)*(x^2+x+1)). - Colin Barker, Aug 07 2013
MATHEMATICA
Join[{1, 27}, LinearRecurrence[{-1, 0, 1, 1}, {12, 19, 12, 21}, 68]] (* Ray Chandler, Sep 08 2015 *)
CROSSREFS
Row n=3 of A247026.
Sequence in context: A040706 A069893 A013681 * A323835 A040705 A317106
KEYWORD
easy,nonn
AUTHOR
David Wasserman, Feb 21 2005
STATUS
approved