|
%I #28 Mar 16 2023 08:50:36
%S 11,39,73,77,111,139,173,177,211,239,273,277,311,339,373,377,411,439,
%T 473,477,511,539,573,577,611,639,673,677,711,739,773,777,811,839,873,
%U 877,911,939,973,977,1011,1039,1073,1077,1111,1139,1173,1177,1211,1239
%N 1-ish numbers (end in 11, 39, 73, 77).
%H Reinhard Zumkeller, <a href="/A045801/b045801.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*(11+28*x+34*x^2+4*x^3+23*x^4)/(1-x-x^4+x^5). - _Colin Barker_, Jan 23 2012
%F a(n) = (50*n-12*i^(n*(n-1))-9*(-1)^n-25)/2, where i=sqrt(-1). - _Bruno Berselli_, Feb 23 2012
%t Table[100n+k,{n,0,20},{k,{11,39,73,77}}]//Flatten (* or *) LinearRecurrence[ {1,0,0,1,-1},{11,39,73,77,111},80] (* _Harvey P. Dale_, Jul 05 2019 *)
%o (Haskell)
%o import Data.List (findIndices)
%o a045801 n = a045801_list !! (n-1)
%o a045801_list = findIndices (`elem` [11,39,73,77]) $ cycle [0..99]
%o -- _Reinhard Zumkeller_, Jan 23 2012
%Y Cf. A045800-A045809, A045572, A045797, A045798.
%K nonn,base,easy
%O 1,1
%A _J. H. Conway_.
%E More terms from _Erich Friedman_.
|
