|
%I #28 Sep 08 2022 08:45:18
%S 11,27,43,59,75,91,107,123,139,155,171,187,203,219,235,251,267,283,
%T 299,315,331,347,363,379,395,411,427,443,459,475,491,507,523,539,555,
%U 571,587,603,619,635,651,667,683,699,715,731,747,763,779,795,811,827,843
%N Numbers congruent to 11 mod 16.
%H Vincenzo Librandi, <a href="/A106839/b106839.txt">Table of n, a(n) for n = 0..10000</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F G.f.: x*(11+5*x) / ( (x-1)^2 ). - _R. J. Mathar_, Oct 08 2011
%F From _Vincenzo Librandi_, Oct 10 2011: (Start)
%F a(n) = 11 + 16*n;
%F a(n) = 32*n - a(n-1) + 6, a(0)=11. (End)
%t Range[11, 1000, 16] (* _Vladimir Joseph Stephan Orlovsky_, May 31 2011 *)
%t LinearRecurrence[{2,-1},{11,27},60] (* _Harvey P. Dale_, Aug 12 2021 *)
%o (Magma) [[ n : n in [1..1000] | n mod 16 eq 11]]; // _Vincenzo Librandi_, Oct 10 2011
%o (PARI) a(n)=16*n+11 \\ _Charles R Greathouse IV_, Oct 16 2015
%o (Python)
%o def a(n): return 11 + 16*n
%o print([a(n) for n in range(53)]) # _Michael S. Branicky_, Nov 27 2021
%Y Differs from A044072.
%Y Cf. A008598, A119413, A051062.
%K nonn,easy
%O 0,1
%A _Ralf Stephan_, May 03 2005
|
