This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A160080 #15 Dec 02 2023 03:26:44 %S A160080 0,1,5,2,3,9,4,13,17,6,7,21,8,25,29,10,11,33,12,37,41,14,15,45,16,49, %T A160080 53,18,19,57,20,61,65,22,23,69,24,73,77,26,27,81,28,85,89,30,31,93,32, %U A160080 97,101,34,35,105,36,109,113,38,39,117,40,121,125,42,43,129,44,133,137,46 %N A160080 Lodumo_4 of Fibonacci numbers. %C A160080 Permutation of nonnegative numbers. %H A160080 OEIS wiki, <a href="/wiki/Lodumo_transform">Lodumo transform</a> %H A160080 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the nonnegative integers</a> %H A160080 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,2,0,0,0,0,0,-1). %F A160080 a(n) = lod_4(A000045(n)). %F A160080 From _Philippe Deléham_, Nov 30 2023: (Start) %F A160080 a(n) = 2*a(n-6) - a(n-12) for n >= 12. %F A160080 a(6*n) = 4*n, a(6*n+1) = 12*n+1, a(6*n+2) = 12*n+5, a(6*n+3) = 4*n+2, a(6*n+4) = 4*n+3, a(6*n+5) = 12*n+9. %F A160080 G.f.: (x + 5*x^2 + 2*x^3 + 3*x^4 + 9*x^5 + 4*x^6 + 11*x^7 + 7*x^8 + 2*x^9 + x^10 + 3*x^11) / ((1-x)^2*(1+x+x^2)^2*(1+x^3)^2). (End) %Y A160080 Cf. A004767, A008586, A016825, A017533, A017581, A017629, A079343. %K A160080 easy,nonn %O A160080 0,3 %A A160080 _Philippe Deléham_, May 01 2009