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.

A113486 a(n) = A113166(n) - Fibonacci(n-1), where Fibonacci(n) = A000045(n).

This page as a plain text file.
%I A113486 #10 Mar 13 2017 04:29:37
%S A113486 0,0,0,1,0,3,0,4,2,7,0,13,0,14,10,21,0,39,0,52,22,65,0,137,12,156,48,
%T A113486 267,0,483,0,652,120,1003,50,1849,0,2602,300,4329,0,7295,0,11086,864,
%U A113486 17733,0,30125,48,46536,1990,75349,0,124683,250,197018,5186,317839,0
%N A113486 a(n) = A113166(n) - Fibonacci(n-1), where Fibonacci(n) = A000045(n).
%C A113486 This sequence appears to be nonnegative. However, a proof of this has not yet been found.
%H A113486 G. C. Greubel, <a href="/A113486/b113486.txt">Table of n, a(n) for n = 1..1000</a>
%F A113486 For prime p, a(p) = 0 (see A113166 for details).
%t A113486 a[n_] := Sum[ k/(n - k)*Sum[ Binomial[(n - k)*GCD[n, k, j]/GCD[n, k],
%t A113486 k*GCD[n, k, j]/GCD[n, k]], {j, 1, GCD[n, k]}], {k, 1, Floor[n/2]}];
%t A113486 Table[a[n] - Fibonacci[n - 1], {n,1,50}] (* _G. C. Greubel_, Mar 12 2017 *)
%Y A113486 Cf. A113166, A000045.
%K A113486 nonn
%O A113486 1,6
%A A113486 _Creighton Dement_, Jan 09 2006; corrected Jun 20 2006
%E A113486 More terms from _R. J. Mathar_, Feb 08 2008
%E A113486 More terms from _Max Alekseyev_, Jun 06 2009