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.

A137495 a(n) = A098601(2n) + A098601(2n+1).

This page as a plain text file.
%I A137495 #22 Jun 29 2024 16:44:43
%S A137495 2,3,4,7,13,23,40,70,123,216,379,665,1167,2048,3594,6307,11068,19423,
%T A137495 34085,59815,104968,184206,323259,567280,995507,1746993,3065759,
%U A137495 5380032,9441298,16568323,29075380,51023735,89540413,157132471,275748264,483904470,849193147,1490230088
%N A137495 a(n) = A098601(2n) + A098601(2n+1).
%H A137495 Nicolas Ollinger and Jeffrey Shallit, <a href="https://arxiv.org/abs/2406.17867">The Repetition Threshold for Rote Sequences</a>, arXiv:2406.17867 [math.CO], 2024.
%H A137495 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,1)
%F A137495 a(3n) = A135364(2n+1). a(3n+1) = A137584(2n+1). a(3n+2) = A137531(2n+2).
%F A137495 From _R. J. Mathar_, Jul 06 2011: (Start)
%F A137495 G.f.: ( -2+x ) / ( -1+2*x-x^2+x^3 ).
%F A137495 a(n) = 2*A005314(n+1) - A005314(n). (End)
%t A137495 LinearRecurrence[{2, -1, 1}, {2, 3, 4}, 50] (* _Paolo Xausa_, Jun 29 2024 *)
%o A137495 (PARI) Vec((x-2)/(-1+2*x-x^2+x^3)+O(x^99)) \\ _Charles R Greathouse IV_, Jul 06 2011
%Y A137495 Cf. A005314, A135364, A137584, A137531.
%K A137495 nonn,easy
%O A137495 0,1
%A A137495 _Paul Curtz_, Apr 27 2008