|
%I #23 Aug 01 2020 16:46:22
%S 9,41,63,87,109,141,163,187,209,241,263,287,309,341,363,387,409,441,
%T 463,487,509,541,563,587,609,641,663,687,709,741,763,787,809,841,863,
%U 887,909,941,963,987,1009,1041,1063,1087,1109,1141,1163,1187,1209,1241
%N 4-ish numbers (end in 09, 41, 63, 87).
%H Reinhard Zumkeller, <a href="/A045804/b045804.txt">Table of n, a(n) for n = 1..1000</a>
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1).
%F G.f.: x*(9+32*x+22*x^2+24*x^3+13*x^4)/(1-x-x^4+x^5). - _Colin Barker_, Jan 23 2012
%t Select[Range[1250],MemberQ[{9,41,63,87},Mod[#,100]]&] (* _Harvey P. Dale_, Aug 01 2020 *)
%o (Haskell)
%o import Data.List (findIndices)
%o a045804 n = a045804_list !! (n-1)
%o a045804_list = findIndices (`elem` [9,41,63,87]) $ cycle [0..99]
%o -- _Reinhard Zumkeller_, Jan 23 2012
%Y Cf. A045800-A045809.
%Y Cf. A045572, A045797, A045798.
%K nonn,base,easy
%O 1,1
%A _J. H. Conway_.
%E More terms from _Erich Friedman_.
|
