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.

A110658 a(n) = A028242(A028242(A028242(n))).

This page as a plain text file.
%I A110658 #14 May 22 2019 02:35:50
%S A110658 1,0,2,1,0,2,1,0,2,1,3,2,1,3,2,1,3,2,4,3,2,4,3,2,4,3,5,4,3,5,4,3,5,4,
%T A110658 6,5,4,6,5,4,6,5,7,6,5,7,6,5,7,6,8,7,6,8,7,6,8,7,9,8,7,9,8,7,9,8,10,9,
%U A110658 8,10,9,8,10,9,11,10,9,11,10,9,11,10,12,11,10,12,11,10,12,11,13,12,11,13
%N A110658 a(n) = A028242(A028242(A028242(n))).
%H A110658 G. C. Greubel, <a href="/A110658/b110658.txt">Table of n, a(n) for n = 0..1000</a>
%H A110658 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,1,-1)
%F A110658 a(n) = A028242(A110657(n)) = A110657(A028242(n)).
%F A110658 a(n) = floor(n/8) + (4 - (n mod 8) mod 3) mod 3.
%F A110658 G.f.: (x^2-x+1)*(x^6-2*x^4+x^2+1) / ((x-1)^2*(x+1)*(x^2+1)*(x^4+1)). - _Colin Barker_, Apr 01 2013
%t A110658 A028242[n_] := (1 + 2*n + 3*(-1)^n)/4; Table[A028242[A028242[ A028242[n] ]], {n, 0, 50}] (* _G. C. Greubel_, Sep 03 2017 *)
%Y A110658 Cf. A110656.
%K A110658 nonn,easy
%O A110658 0,3
%A A110658 _Reinhard Zumkeller_, Aug 05 2005