|
%I #5 Sep 30 2014 08:06:59
%S 1,3,2,1,5,19,18,17,16,3,14,12,4,11,10,9,8,7,6,5,4,3,2,1,25,99,98,9,
%T 36,95,94,93,92,91,90,12,88,23,50,10,68,83,22,81,80,79,11,24,76,15,74,
%U 73,5,71,18,29,8,67,66,12,28,63,62,1,20,47,58,41,56,40,54,17,24,11,50,49,48
%N Least number k such that k + n divides F(n)^2 + F(k)^2.
%C F(n) denotes the n-th Fibonacci number. I believe a(n) exists for all n > 0.
%o (PARI)
%o a(n)=m=1;while((fibonacci(n)^2+fibonacci(m)^2)%(m+n),m++);m
%o vector(100,n,a(n))
%Y Cf. A000045, A247937, A248032.
%K nonn
%O 1,2
%A _Derek Orr_, Sep 29 2014
|
