|
%I #20 Jun 08 2021 02:30:38
%S 1,5,25,125,625,3125,15625,75025,78125,375125,390625,1875625,1953125,
%T 9378125,9765625,46890625,48828125,234453125,244140625,332813125,
%U 1172265625,1220703125,1664065625,5628750625,5861328125,6103515625,8320328125,9006076025
%N Numbers k such that k divides Fibonacci(k) with multiples of 12 excluded.
%C Set difference of A023172 and 12*A072378.
%C The sequence is closed under multiplication.
%C Also, if m is in this sequence (i.e., gcd(F(m),m)=m) then F(m) is in this sequence (since gcd(F(F(m)),F(m)) = F(gcd(F(m),m)) = F(m)).
%C In particular, this sequence includes all terms of geometric progressions 5^k*Fibonacci(5^m) for integers k >= 0 and m >= 0.
%H F. Lengyel, <a href="http://employees.oxy.edu/lengyel/papers/FQp_sect112502M.pdf">Divisibility Properties by Multisection</a>
%e a(1) = Fibonacci(1) = 1,
%e a(2) = Fibonacci(5) = 5,
%e a(3)..a(7) = {5^2, 5^3, 5^4, 5^5, 5^6},
%e a(8) = 75025 = 5^2*3001 = Fibonacci(5^2),
%e a(9) = 5^7,
%e a(10) = 375125 = 5^3*3001 = 5*Fibonacci(5^2),
%e a(11) = 5^8.
%t Do[ If[ !IntegerQ[ n/12 ] && IntegerQ[ Fibonacci[n] / n ], Print[n] ], {n,1,5^8} ]
%o (PARI) is(n)=n%12 && (Mod([0,1;1,1],n)^n*[0;1])[1,1]==0 \\ _Charles R Greathouse IV_, Nov 04 2016
%Y Prime divisors are given in A171980. Their smallest multiples are given in A171981.
%Y Cf. A072378, A023172.
%K nonn
%O 1,2
%A _Alexander Adamchuk_, May 11 2007
%E Edited and extended by _Max Alekseyev_, Sep 20 2009
%E a(1)=1 added by _Zak Seidov_, Nov 01 2009
%E Edited and extended by _Max Alekseyev_, Jan 20 2010
|
