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 A097083 #38 Nov 09 2024 18:16:15
%S A097083 1,2,3,5,9,15,24,39,64,104,168,272,441,714,1155,1869,3025,4895,7920,
%T A097083 12815,20736,33552,54288,87840,142129,229970,372099,602069,974169,
%U A097083 1576239,2550408,4126647,6677056,10803704,17480760,28284464,45765225
%N A097083 Positive values of k such that there is exactly one permutation p of (1,2,3,...,k) such that i+p(i) is a Fibonacci number for 1<=i<=k.
%C A097083 Numbers k such that A097082(k) = 1. If f is a Fibonacci number and k < f <= 2k, then a permutation for f-k-1 may be extended to a permutation for k, with p(i) = f-i for f-k < i <= k. This explains the sparseness of this sequence. - _David Wasserman_, Dec 19 2007
%C A097083 If the formula is correct, the bisections give A059840 and A064831. - _David Wasserman_, Dec 19 2007
%H A097083 G. C. Greubel, <a href="/A097083/b097083.txt">Table of n, a(n) for n = 1..1000</a>
%H A097083 Andreas M. Hinz and Paul K. Stockmeyer, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL25/Hinz/hinz5.html">Precious Metal Sequences and Sierpinski-Type Graphs</a>, J. Integer Seq., Vol 25 (2022), Article 22.4.8.
%H A097083 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,1,0,-1).
%F A097083 It appears that {a(n)} satisfies a(1)=1, a(2)=2 and, for n>2, a(n) = F(n+2) - a(n-2) - 1, where {F(k)} is the sequence of Fibonacci numbers, i.e, that the sequence is the partial sums of A006498.
%F A097083 If the partial sum assumption is correct: a(n) = floor(phi^(n+3)/5), where phi=(1+sqrt(5))/2 = A001622, and a(n) = a(n-1) + a(n-2) + ( (n*(n+1)/2) mod 2). - _Gary Detlefs_, Mar 12 2011
%F A097083 From _R. J. Mathar_, Mar 13 2011: (Start)
%F A097083 If the partial sum assumption is correct: a(n)= +2*a(n-1) -a(n-2) +a(n-3) -a(n-5).
%F A097083 G.f.: x/( (x-1)*(x^2+1)*(x^2+x-1) ).
%F A097083 a(n) = A000032(n+3)/5 -(-1)^n*A112030(n)/10 - 1/2. (End)
%F A097083 Conjecture: a(n) = floor(F(n+3)/sqrt(5)), where F(n) = A000045(n) are Fibonacci numbers. - _Vladimir Reshetnikov_, Nov 05 2015
%t A097083 a=b=c=d=0;Table[e=a+b+d+1;a=b;b=c;c=d;d=e,{n,100}] (* _Vladimir Joseph Stephan Orlovsky_, Feb 26 2011 *)
%t A097083 CoefficientList[Series[x/((x - 1)*(x^2 + 1)*(x^2 + x - 1)), {x,0,50}], x] (* _G. C. Greubel_, Mar 05 2017 *)
%t A097083 LinearRecurrence[{2,-1,1,0,-1},{1,2,3,5,9},50] (* _Harvey P. Dale_, Nov 09 2024 *)
%o A097083 (PARI) x='x+O('x^50); Vec(x/((x - 1)*(x^2 + 1)*(x^2 + x - 1))) \\ _G. C. Greubel_, Mar 05 2017
%Y A097083 Cf. A073364, A000045.
%K A097083 nonn
%O A097083 1,2
%A A097083 _John W. Layman_, Jul 23 2004
%E A097083 a(9) from _Ray Chandler_, Jul 29 2004
%E A097083 More terms from _David Wasserman_, Dec 19 2007
%E A097083 Terms > 90000 assuming the partial sums formula by _Vladimir Joseph Stephan Orlovsky_, Feb 26 2011