A003249 a(n) = A001950(A003234(n)) + 1.

8, 21, 29, 42, 50, 55, 63, 76, 84, 97, 110, 118, 131, 139, 144, 152, 165, 173, 186, 194, 199, 207, 220, 228, 241, 254, 262, 275, 283, 288, 296, 309, 317, 330, 338, 343, 351, 364, 372, 377, 385, 398, 406, 419, 427, 432, 440, 453, 461, 474, 487, 495, 508, 516

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn

Comments

This is the function named u' in [Carlitz]. - Eric M. Schmidt, Aug 14 2014

References

• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• L. Carlitz, R. Scoville and T. Vaughan, Some arithmetic functions related to Fibonacci numbers, Fib. Quart., 11 (1973), 337-386.

Crossrefs

Cf. A242094 (complement), A001950, A003234.

Programs

Haskell

a003249 = (+ 1) . a001950 . a003234 -- Reinhard Zumkeller, Oct 03 2014

Maple

A003249 := proc(n)
    A001950(A003234(n)) +1 ;
end proc:
seq(A003249(n),n=1..80) ; # R. J. Mathar, Jul 16 2024

Mathematica

nmax = 80;
A001950[n_] := Floor[n*GoldenRatio^2];
A003231[n_] := 2*n + Floor[n*GoldenRatio];
A003234 = Select[Range[4*nmax],
   A003231[A001950[#]] == A001950[A003231[#]] - 1&];
a[n_] := A001950[A003234[[n]]] + 1;
Table[a[n], {n, 1, nmax}] (* Jean-François Alcover, Jul 21 2024 *)

Extensions

Corrected and extended by, and a definition from Eric M. Schmidt, Aug 14 2014