login
a(2n) = A003256(n); a(2n-1) = A003256(n) - 1.
3

%I #8 Oct 05 2014 02:23:36

%S 1,2,4,5,6,7,8,9,11,12,13,14,16,17,18,19,20,21,23,24,25,26,27,28,30,

%T 31,32,33,35,36,37,38,39,40,42,43,44,45,46,47,48,49,50,51,53,54,55,56,

%U 57,58,60,61,62,63,65,66,67,68,69,70,72,73,74,75,76,77,79

%N a(2n) = A003256(n); a(2n-1) = A003256(n) - 1.

%C This is the function named w in [Carlitz] (cf. Thm. 7.9), which defines this sequence by the property A242094(a(n)) is the n-th positive integer not of the form A000201(A001950(m)).

%H L. Carlitz, R. Scoville and T. Vaughan, <a href="http://www.fq.math.ca/Scanned/11-4/carlitz.pdf">Some arithmetic functions related to Fibonacci numbers</a>, Fib. Quart., 11 (1973), 337-386.

%o (Haskell)

%o import Data.List (transpose)

%o a247419 n = a247419_list !! (n-1)

%o a247419_list = concat $

%o transpose [map (subtract 1) a003256_list, a003256_list]

%o -- _Reinhard Zumkeller_, Oct 03 2014

%K nonn

%O 1,2

%A _Eric M. Schmidt_, Sep 16 2014