|
%I #30 Jun 09 2023 17:44:51
%S 2,11,20,29,38,47,56,65,74,83,92,101,110,119,128,137,146,155,164,173,
%T 182,191,200,209,218,227,236,245,254,263,272,281,290,299,308,317,326,
%U 335,344,353,362,371,380,389,398,407,416,425,434,443,452,461,470,479
%N 9*n+2.
%C Numbers whose digital root is 2. - _Cino Hilliard_, Dec 26 2006
%H Vincenzo Librandi, <a href="/A017185/b017185.txt">Table of n, a(n) for n = 0..5000</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.: ( 2+7*x ) / (x-1)^2 . - _R. J. Mathar_, Jul 14 2016
%t Range[2, 1000, 9] (* _Vladimir Joseph Stephan Orlovsky_, May 28 2011 *)
%t LinearRecurrence[{2,-1},{2,11},60] (* _Harvey P. Dale_, Jun 09 2023 *)
%o (Magma) [9*n+2: n in [0..60]]; // _Vincenzo Librandi_, Jul 23 2011
%o (PARI) a(n)=9*n+2 \\ _Charles R Greathouse IV_, Oct 07 2015
%Y Cf. A008591, A017173.
%K nonn,easy
%O 0,1
%A _N. J. A. Sloane_.
%E More terms from _Cino Hilliard_, Dec 26 2006
|
