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 A248032 #11 Jan 03 2018 17:59:03 %S A248032 1,22,9,8,1,18,10,4,3,5,35,12,17,10,3,8,13,6,31,4,9,2,47,12,5,8,9,20, %T A248032 1,18,19,16,3,5,10,12,13,10,38,8,109,6,7,4,9,2,14,12,1,22,39,8,97,18, %U A248032 58,4,32,14,191,12,89,1,27,8,85,6,70,4,39,2,11,24,77,22,15,13,73,18,10 %N A248032 Least positive number k such that n + k divides F(n) + F(k), where F(n) denotes the n-th Fibonacci number. %C A248032 I believe a(n) exists for all n > 0. %H A248032 Chai Wah Wu, <a href="/A248032/b248032.txt">Table of n, a(n) for n = 1..10000</a> %o A248032 (PARI) %o A248032 a(n)=m=1;while((fibonacci(n)+fibonacci(m))%(m+n),m++);m %o A248032 vector(100,n,a(n)) %Y A248032 Cf. A000045, A247937. %K A248032 nonn %O A248032 1,2 %A A248032 _Derek Orr_, Sep 29 2014 %E A248032 Definition clarified by _Chai Wah Wu_, Jan 02 2018