A103949 a(n) is the number of distinct n-th powers of functions {1, 2, 3, 4} -> {1, 2, 3, 4}.

1, 256, 100, 116, 73, 148, 44, 148, 73, 116, 76, 148, 41, 148, 76, 116, 73, 148, 44, 148, 73, 116, 76, 148, 41, 148, 76, 116, 73, 148, 44, 148, 73, 116, 76, 148, 41, 148, 76, 116, 73, 148, 44, 148, 73, 116, 76, 148, 41, 148, 76, 116, 73, 148, 44, 148, 73, 116, 76, 148

Offset: 0

Author

David Wasserman, Feb 21 2005

Keywords

• easy
• nonn

Comments

For n > 2, a(n) = a(n+12).

Links

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

Crossrefs

Cf. A102687, A102709, A103947, A103948, A103950.

Row n=4 of A247026.

Programs

Mathematica

LinearRecurrence[{-1,-1,0,1,1,1},{1,256,100,116,73,148,44,148,73},60] (* Harvey P. Dale, Jun 22 2015 *)

Formula

G.f.: (24*x^8+132*x^7+92*x^6-80*x^5-288*x^4-472*x^3-357*x^2-257*x-1) / ((x-1)*(x+1)*(x^2+1)*(x^2+x+1)). - Colin Barker, Aug 07 2013