|
%I #15 Dec 12 2013 03:22:51
%S 41,123,205,287,369,451,533,615,697,779,861,943,1025,1107,1189,1271,
%T 1353,1435,1517,1599,1681,1763,1845,1927,2009,2091,2173,2255,2337,
%U 2419,2501,2583,2665,2706,2747,2829,2911,2993,3075,3157,3239,3321,3403,3485,3567,3649
%N a(n) = the position of A232099(n) in A055926.
%C In range n=1..2215, each a(n) is a multiple of 41, with a(2215) = 177079 = 4319*41. In that range, all 2160 odd multiples 1, 3, 5, ..., 4319*41 occur, but only 55 even multiples, with a(34) = 66*41 = 2706 being the first one of them. The multipliers for even terms in that range seems to be given by 66*A047253(1..55) from 66*1 up to 66*A047253(55) = 66*65 = 4290. (Where A047253 gives the numbers not divisible by six).
%H Antti Karttunen, <a href="/A232100/b232100.txt">Table of n, a(n) for n = 1..10007</a>
%F A055926(a(n)) = A232099(n) for all n.
%o (Scheme, with memoizing definec-macro from _Antti Karttunen_'s IntSeq-library)
%o (definec (A232100 n) (let ((x (A232099 n))) (let loop ((i (if (= 1 n) 1 (A232100 (- n 1))))) (if (= (A055926 i) x) i (loop (+ 1 i))))))
%Y Cf. A232099, A055926, A047253, A232741.
%K nonn
%O 1,1
%A _Antti Karttunen_, Nov 18 2013
|
