|
%I #12 May 23 2015 11:46:48
%S 0,1,1,1,2,4,4,3,3,4,5,8,5,7,6,7,10,6,10,11,11,10,11,10,13,12,12,12,
%T 12,18,15,19,19,14,16,16,21,19,19,18,19,15,20,22,20,22,20,22,26,19,29,
%U 29,24,30,28,23,27,27,36,25,30,31,29,36,35,28,32,34,29
%N For p = prime(n), number of primes k with k < p such that F_{p-(p/k)} == 0 (mod p), where F_i = A000045(i) and (a/b) denotes the Legendre symbol.
%H Felix Fröhlich, <a href="/A257978/b257978.txt">Table of n, a(n) for n = 1..4000</a>
%t Join[{0}, Table[Sum[Boole[Divisible[Fibonacci[Prime[n] - JacobiSymbol[Prime[n], Prime[k]]], Prime[n]]], {k, n - 1}], {n, 2, 50}]] (* _Alonso del Arte_, May 16 2015 *)
%o (PARI) forprime(p=2, 400, i=0; forprime(k=2, p, if(Mod(fibonacci(p-kronecker(p, k)), p)==0, i++)); print1(i, ", "))
%Y Cf. A257979.
%K nonn
%O 1,5
%A _Felix Fröhlich_, May 15 2015
|
