|
%I #29 Jun 23 2022 13:46:52
%S 1,4,6,10,12,14,16,20,22,26,28,30,32,36,38,40,42,46,48,52,54,56,58,62,
%T 64,68,70,72,74,78,80,82,84,88,90,94,96,98,100,104,106,108,110,114,
%U 116,120,122,124,126,130,132,136,138,140,142,146,148,150,152,156
%N The first column in Clark Kimberling's even first column Stolarsky array (beginning column count at 1).
%H G. C. Greubel, <a href="/A199536/b199536.txt">Table of n, a(n) for n = 1..5000</a>
%H C. Kimberling, <a href="http://www.fq.math.ca/Scanned/32-4/kimberling.pdf">The first column of an interspersion</a>, Fibonacci Quarterly 32 (1994), pp. 301-314.
%F Define Phi = (1+sqrt(5))/2, then a(1) = 1, a(2*n) = 2*floor(n*Phi) + 2*n, a(2*n+1) = 2*floor(n*Phi) + 2*n + 2.
%F a(n) = A199535(n, n). - _G. C. Greubel_, Jun 22 2022
%t a[n_]:= If[Mod[n,2]==0, 2*Floor[(n/2)*GoldenRatio] +n, 2*Floor[(n-1)/2*GoldenRatio] +n+1] -Boole[n==1];
%t Table[a[n], {n,80}] (* _G. C. Greubel_, Jun 22 2022 *)
%o (SageMath)
%o def A199536(n):
%o if (n==1): return 1
%o elif (n%2==0): return 2*floor(n*golden_ratio/2) + n
%o else: return 2*floor((n-1)*golden_ratio/2) +n+1
%o [A199536(n) for n in (1..80)] # _G. C. Greubel_, Jun 22 2022
%Y Cf. A199535, A199537.
%K nonn
%O 1,2
%A _Casey Mongoven_, Nov 07 2011
|
