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 A099255 #24 Mar 12 2024 12:47:53
%S A099255 7,6,15,15,38,39,99,102,259,267,678,699,1775,1830,4647,4791,12166,
%T A099255 12543,31851,32838,83387,85971,218310,225075,571543,589254,1496319,
%U A099255 1542687,3917414,4038807,10255923,10573734,26850355,27682395,70295142,72473451
%N A099255 Expansion of g.f. (7+6*x-6*x^2-3*x^3)/((x^2+x-1)*(x^2-x-1)).
%C A099255 One of two sequences involving the Lucas/Fibonacci numbers.
%C A099255 This sequence consists of pairs of numbers more or less close to each other with "jumps" in between pairs. "pos((Ex)^n)" sums up over all floretion basis vectors with positive coefficients for each n. The following relations appear to hold: a(2n) - (a(2n-1) + a(2n-2)) = 2*Luc(2n) a(2n+1) - a(2n) = Fib(2n), apart from initial term a(2n+1)/a(2n-1) -> 2 + golden ratio phi a(2n)/a(2n-2) -> 2 + golden ratio phi An identity: (1/2)a(n) - (1/2)A099256(n) = ((-1)^n)A000032(n)
%H A099255 Harvey P. Dale, <a href="/A099255/b099255.txt">Table of n, a(n) for n = 0..1000</a>
%H A099255 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0,3,0,-1).
%F A099255 a(n) = 2*pos((Ex)^n)
%F A099255 a(0) = 7, a(1) = 6, a(2) = a(3) = 15, a(n+4) = 3a(n+2) - a(n).
%F A099255 a(2n) = A022097(2n+1), a(2n+1) = A022086(2n+3).
%F A099255 a(n) = A061084(n+1)+A013655(n+2). [_R. J. Mathar_, Nov 30 2008]
%t A099255 LinearRecurrence[{0,3,0,-1},{7,6,15,15},40] (* _Harvey P. Dale_, Dec 29 2012 *)
%Y A099255 Cf. A099256, A000032.
%K A099255 nonn,easy
%O A099255 0,1
%A A099255 _Creighton Dement_, Oct 09 2004
%E A099255 More terms from _Creighton Dement_, Apr 19 2005