|
%I #18 Nov 14 2022 17:25:42
%S 51,57,93,99,151,157,193,199,251,257,293,299,351,357,393,399,451,457,
%T 493,499,551,557,593,599,651,657,693,699,751,757,793,799,851,857,893,
%U 899,951,957,993,999,1051,1057,1093,1099,1151,1157,1193,1199,1251,1257
%N 5-ish numbers (end in 51, 57, 93, 99).
%H Reinhard Zumkeller, <a href="/A045805/b045805.txt">Table of n, a(n) for n = 1..1000</a>
%F Empirical G.f.: x*(51+6*x+36*x^2+6*x^3+x^4)/(1-x-x^4+x^5). [Colin Barker, Jan 23 2012]
%t Select[Range[50,1500],MemberQ[{51,57,93,99},Mod[#,100]]&] (* _Harvey P. Dale_, Nov 14 2022 *)
%o (Haskell)
%o import Data.List (findIndices)
%o a045805 n = a045805_list !! (n-1)
%o a045805_list = findIndices (`elem` [51,57,93,99]) $ 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_.
|
