cp's OEIS Frontend

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.

A367651 Inverse of permutation of A160079.

This page as a plain text file.
%I A367651 #19 Nov 29 2023 18:50:22
%S A367651 0,1,3,4,2,5,8,7,6,12,9,11,16,10,13,20,15,14,24,17,19,28,18,21,32,23,
%T A367651 22,36,25,27,40,26,29,44,31,30,48,33,35,52,34,37,56,39,38,60,41,43,64,
%U A367651 42,45,68,47,46,72,49,51,76,50,53,80,55,54,84,57,59
%N A367651 Inverse of permutation of A160079.
%C A367651 Permutation of nonnegative numbers.
%H A367651 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the nonnegative integers</a>
%H A367651 <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1,0,0,0,0,0,1,0,0,-1).
%F A367651 a(n) = 2*a(n-9) - a(n-18) for n >= 18.
%F A367651 a(9*n) = 12*n, a(9*n+1) = 8*n+1, a(9*n+2) = 8*n+3, a(9*n+3) = 12*n+4, a(9*n+4) = 8*n+2, a(9*n+5) = 8*n+5, a(9*n+6) = 12*n+8, a(9*n+7) = 8n+7, a(9*n+8) = 8*n+6.
%F A367651 a(n) = a(n-3) + a(n-9) - a(n-12) for n >= 12.
%F A367651 G.f.: (x + 3*x^2 + 4*x^3 + x^4 + 2*x^5 + 4*x^6 + 5*x^7 + x^8 + 4*x^9 + x^10 + 2*x^11) / ((1 - x)^2*(1 + x + x^2)^2*(1 + x^3 + x^6)).
%Y A367651 Cf. A160079.
%K A367651 nonn,easy
%O A367651 0,3
%A A367651 _Philippe Deléham_, Nov 25 2023