A047621 Numbers that are congruent to {3, 5} mod 8.
3, 5, 11, 13, 19, 21, 27, 29, 35, 37, 43, 45, 51, 53, 59, 61, 67, 69, 75, 77, 83, 85, 91, 93, 99, 101, 107, 109, 115, 117, 123, 125, 131, 133, 139, 141, 147, 149, 155, 157, 163, 165, 171, 173, 179, 181, 187, 189, 195, 197, 203, 205, 211, 213, 219, 221, 227, 229
Offset: 1
Links
- Muniru A Asiru, Table of n, a(n) for n = 1..5000
- Index entries for linear recurrences with constant coefficients, signature (1,1,-1).
Crossrefs
Programs
-
GAP
a:=[3];; for n in [2..60] do a[n]:=8*n-a[n-1]-8; od; a; # Muniru A Asiru, Dec 04 2018
-
Haskell
a047621 n = a047621_list !! (n-1) a047621_list = 3 : 5 : map (+ 8) a047621_list -- Reinhard Zumkeller, Jul 05 2013
-
Mathematica
LinearRecurrence[{1, 1, -1}, {3, 5, 11}, 100] (* Jean-François Alcover, Jul 31 2018 *)
Formula
a(n) = 8*n - a(n-1) - 8 (with a(1) = 3). - Vincenzo Librandi, Aug 06 2010
G.f.: x*(3 + 2*x + 3*x^2) / ( (1 + x)*(x - 1)^2 ). - R. J. Mathar, Oct 08 2011
A089911(3*a(n)) = 10. - Reinhard Zumkeller, Jul 05 2013
a(n) = 8*floor((n - 1)/2) + 4 + (-1)^n. - Gary Detlefs, Dec 03 2018
From Franck Maminirina Ramaharo, Dec 03 2018: (Start)
a(n) = 4*n - 2 - (-1)^n.
E.g.f.: 3 - (2 - 4*x)*exp(x) - exp(-x). (End)
a(n + 2) = a(n) + 8. - David A. Corneth, Dec 03 2018
Sum_{n>=1} (-1)^(n+1)/a(n) = (sqrt(2)-1)*Pi/8. - Amiram Eldar, Dec 11 2021
From Amiram Eldar, Nov 22 2024: (Start)
Product_{n>=1} (1 - (-1)^n/a(n)) = sec(Pi/8) (1/A144981).
Product_{n>=1} (1 + (-1)^n/a(n)) = 2*sin(Pi/8) (A101464). (End)
Comments