OFFSET
1,1
LINKS
Harry J. Smith, Table of n, a(n) for n=1..1000
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,1,-1).
FORMULA
a(n) = n + A010888(n).
G.f.: -x*(9*x^9-2*x^8-2*x^7-2*x^6-2*x^5-2*x^4-2*x^3-2*x^2-2*x-2) / ((x-1)^2*(x^2+x+1)*(x^6+x^3+1)). - Colin Barker, Apr 05 2013
MAPLE
A064806 := proc(n) return n+1 + ((n-1) mod 9): end: seq(A064806(n), n=1..100); # Nathaniel Johnston, May 04 2011
MATHEMATICA
Table[n+Mod[n-1, 9]+1, {n, 70}] (* or *) LinearRecurrence[{1, 0, 0, 0, 0, 0, 0, 0, 1, -1}, {2, 4, 6, 8, 10, 12, 14, 16, 18, 11}, 70] (* Harvey P. Dale, Nov 19 2022 *)
PROG
(PARI) { for (n=1, 1000, write("b064806.txt", n, " ", n + (n - 1)%9 + 1) ) } \\ Harry J. Smith, Sep 26 2009
(Haskell)
a064806 n = n + a010888 n -- Reinhard Zumkeller, Apr 13 2013
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
Reinhard Zumkeller, Oct 21 2001
STATUS
approved