cp's OEIS Frontend

A160079 Lodumo_3 of Fibonacci numbers.

%I A160079 #36 Dec 02 2023 03:26:27
%S A160079 0,1,4,2,3,5,8,7,6,10,13,11,9,14,17,16,12,19,22,20,15,23,26,25,18,28,
%T A160079 31,29,21,32,35,34,24,37,40,38,27,41,44,43,30,46,49,47,33,50,53,52,36,
%U A160079 55,58,56,39,59,62,61,42,64,67,65,45,68,71,70,48,73,76,74,51,77,80,79,54
%N A160079 Lodumo_3 of Fibonacci numbers.
%C A160079 Permutation of nonnegative integers.
%H A160079 OEIS wiki, <a href="/wiki/Lodumo_transform">Lodumo transform</a>
%H A160079 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the nonnegative integers</a>
%H A160079 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,1,0,0,0,1,0,0,0,-1).
%F A160079 a(n) = lod_3(A000045(n)).
%F A160079 a(n) = 2*a(n-8) - a(n-16) for n >= 16. - _Philippe Deléham_, Mar 09 2023
%F A160079 a(8*n) = 6*n, a(8*n+1) = 9*n+1, a(8*n+2) = 9*n+4, a(8*n+3) = 9*n+2, a(8*n+4) = 6*n+3, a(8*n+5) = 9*n+5, a(8*n+6) = 9*n+8, a(8*n+7) = 9*n+7. - _Philippe Deléham_, Nov 24 2023
%F A160079 From _Philippe Deléham_, Nov 29 2023 : (Start)
%F A160079 a(n) = a(n-4) + a(n-8) - a(n-12) for n >= 12.
%F A160079 G.f. : (x + 4*x^2 + 2*x^3 + 3*x^4 + 4*x^5 + 4*x^6 + 5*x^7 + 3*x^8 + 4*x^9 + x^10 + 2*x^11) / (1 - x^4 - x^8 + x^12). (End)
%Y A160079 Cf. A000045, A082115, A160016, A160051, A367651 (inverse permutation).
%K A160079 nonn,easy
%O A160079 0,3
%A A160079 _Philippe Deléham_, May 01 2009