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.

A133256 a(4*n+1) = 4*n+1, a(4*n+2) = 4*n+2, a(4*n+3) = 4*n+4, a(4*n+4) = 4*n+3.

This page as a plain text file.
%I A133256 #23 Jan 31 2023 08:30:05
%S A133256 1,2,4,3,5,6,8,7,9,10,12,11,13,14,16,15,17,18,20,19,21,22,24,23,25,26,
%T A133256 28,27,29,30,32,31,33,34,36,35,37,38,40,39,41,42,44,43,45,46,48,47,49,
%U A133256 50,52,51,53,54,56,55,57,58,60,59,61,62,64,63,65,66,68,67,69,70,72,71
%N A133256 a(4*n+1) = 4*n+1, a(4*n+2) = 4*n+2, a(4*n+3) = 4*n+4, a(4*n+4) = 4*n+3.
%C A133256 A permutation of the positive integers, swapping consecutive values congruent to 3 and 4 (mod 4). - _Franklin T. Adams-Watters_, Jan 22 2012.
%C A133256 This is the lexicographically earliest sequence of distinct positive integers such that no polynomial of degree d can be fitted to d+2 consecutive terms (equivalently, such that no iterated difference is zero). - _Pontus von Brömssen_, Dec 26 2021
%H A133256 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,1,-1).
%F A133256 From _Chai Wah Wu_, Sep 10 2020: (Start)
%F A133256 a(n) = a(n-1) + a(n-4) - a(n-5) for n > 5.
%F A133256 G.f.: x*(x^4 - x^3 + 2*x^2 + x + 1)/(x^5 - x^4 - x + 1). (End)
%F A133256 Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/4 - log(2)/2. - _Amiram Eldar_, Jan 31 2023
%t A133256 Table[Which[Mod[n,4]==3,n+1,Divisible[n,4],n-1,True,n],{n,40}] (* or *) Partition[Range[40],4]/.{a_,b_,c_,d_}->{a,b,d,c}//Flatten (* _Harvey P. Dale_, Aug 29 2016 *)
%Y A133256 Cf. A103889.
%K A133256 nonn
%O A133256 1,2
%A A133256 _Paul Curtz_, Oct 15 2007
%E A133256 Definition fixed and offset changed by _Franklin T. Adams-Watters_, Jan 22 2012