Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #21 Dec 20 2023 08:04:59
%S 2,6,11,15,19,23,28,32,36,40,44,49,53,57,61,66,70,74,78,83,87,91,95,
%T 100,104,108,112,116,121,125,129,133,138,142,146,150,155,159,163,167,
%U 172,176,180,184,189,193,197,201
%N Second column of Stolarsky array.
%H Benoit Cloitre and Jeffrey Shallit, <a href="https://arxiv.org/abs/2312.11706">Some Fibonacci-Related Sequences</a>, arXiv:2312.11706 [math.CO], 2023.
%H N. J. A. Sloane, <a href="/classic.html#WYTH">Classic Sequences</a>
%F a(n) = A007067(A007064(n)).
%e For n=4, A007064(4)=12 and A007067(12)=19, so a(4)=19.
%t Table[Floor[(# + 1/2) (Sqrt@ 5 + 3)] &[n - 1] - n + 1, {n, 48}] (* _Michael De Vlieger_, Aug 28 2016, after _T. D. Noe_ at A001966 *)
%Y See A007064 for references.
%Y Cf. A007064, A035489.
%Y Equals A001966(n-1) - n + 1.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_