A056020 Numbers that are congruent to +-1 mod 9.
1, 8, 10, 17, 19, 26, 28, 35, 37, 44, 46, 53, 55, 62, 64, 71, 73, 80, 82, 89, 91, 98, 100, 107, 109, 116, 118, 125, 127, 134, 136, 143, 145, 152, 154, 161, 163, 170, 172, 179, 181, 188, 190, 197, 199, 206, 208, 215, 217, 224, 226, 233, 235, 242, 244, 251, 253
Offset: 1
Links
- Vincenzo Librandi, Table of n, a(n) for n = 1..10000
- Index entries for linear recurrences with constant coefficients, signature (1,1,-1).
Crossrefs
Programs
-
Haskell
a056020 n = a056020_list !! (n-1) a05602_list = 1 : 8 : map (+ 9) a056020_list -- Reinhard Zumkeller, Jan 07 2012
-
Mathematica
Select[ Range[ 300 ], PowerMod[ #, 2, 3^2 ]==1& ] (* or *) LinearRecurrence[{1, 1, -1}, {1, 8, 10}, 67] (* Mike Sheppard, Feb 18 2025 *)
-
PARI
a(n)=9*(n>>1)+if(n%2,1,-1) \\ Charles R Greathouse IV, Jun 29 2011
-
PARI
for(n=1,40,print1(9*n-8,", ",9*n-1,", ")) \\ Charles R Greathouse IV, Jun 29 2011
Formula
a(1) = 1; a(n) = 9(n-1) - a(n-1). - Rolf Pleisch, Jan 31 2008 [Offset corrected by Jon E. Schoenfield, Dec 22 2008]
From R. J. Mathar, Feb 10 2008: (Start)
O.g.f.: 1 + 5/(4(x+1)) + 27/(4(-1+x)) + 9/(2(-1+x)^2).
a(n+1) - a(n) = A010697(n). (End)
a(n) = (9*A132355(n) + 1)^(1/2). - Gary Detlefs, Feb 22 2010
From Bruno Berselli, Nov 17 2010: (Start)
a(n) = a(n-2) + 9, for n > 2.
a(n) = 9*A000217(n-1) + 1 - 2*Sum_{i=1..n-1} a(i), n > 1. (End)
E.g.f.: 1 + ((18*x - 9)*exp(x) + 5*exp(-x))/4. - David Lovler, Sep 04 2022
From Amiram Eldar, Nov 22 2024: (Start)
Product_{n>=1} (1 - (-1)^n/a(n)) = 2*cos(Pi/9) (A332437).
Product_{n>=2} (1 + (-1)^n/a(n)) = (Pi/9)*cosec(Pi/9). (End)
From Mike Sheppard, Feb 18 2025: (Start)
a(n) = a(n-1) + a(n-2) - a(n-3).
a(n) ~ (3^2/2)*n. (End)
Comments