Search: id:A001602
Results 1-1 of 1 results found.

%I A001602 M2310 N0912
%S A001602 3,4,5,8,10,7,9,18,24,14,30,19,20,44,16,27,58,15,68,70,37,78,84,11,49,
%T A001602 50,104,36,27,19,128,130,69,46,37,50,79,164,168,87,178,90,190,97,99,22,
%U A001602 42,224,228,114,13,238,120,250,129,88,67,270,139,28,284,147,44,310
%N A001602 Fibonacci entry points: a(n) = smallest m such that n-th prime divides 
               Fibonacci(m).
%C A001602 "[a(n)] is called by Lucas the rank of apparition of p and we know it 
               is a divisor of, or equal to p-1 or p+1" - Vajda, p. 84. [Note that 
               a(5)=5. This is the only exception. - Chris Caldwell, Nov 03 2008]
%C A001602 Every number except 1, 2, 6 and 12 eventually occurs in this sequence. 
               The number of times n occurs is A086597(n), the number of primitive 
               prime factors of Fibonacci(n). - T. D. Noe, Jun 13 2008
%D A001602 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A001602 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A001602 A. Brousseau, Fibonacci and Related Number Theoretic Tables. Fibonacci 
               Association, San Jose, CA, 1972, p. 25.
%D A001602 D. E. Daykin and L. A. G. Dresel, Fibonacci Quarterly, vol 7 (1969), 
               pages 23 - 30 and 82.
%D A001602 Ramon Glez-Regueral, An entry-point algorithm for high-speed factorization, 
               Thirteenth Internat. Conf. Fibonacci Numbers Applications, Patras, 
               Greece, 2008.
%D A001602 D. Jarden, Recurring Sequences. Riveon Lematematika, Jerusalem, 1966.
%D A001602 D. Lind et al., Tables of Fibonacci entry points, part 2, reviewed in 
               Math. Comp., 20 (1966), 618-619.
%D A001602 S. Vajda, Fibonacci and Lucas numbers and the Golden Section, Ellis Horwood 
               Ltd., Chichester, 1989.
%D A001602 M. Wunderlich, Tables of Fibonacci entry points, reviewed in Math. Comp., 
               20 (1966), 618-619.
%H A001602 T. D. Noe, <a href="b001602.txt">Table of n, a(n) for n=1..10000</a>
%e A001602 The 5th prime is 11 and 11 first divides Fib(10)=55, so a(5) = 10.
%Y A001602 Cf. A051694, A001177.
%Y A001602 Sequence in context: A050590 A066906 A125884 this_sequence A087012 A047366 
               A117483
%Y A001602 Adjacent sequences: A001599 A001600 A001601 this_sequence A001603 A001604 
               A001605
%K A001602 nonn,easy,nice
%O A001602 1,1
%A A001602 N. J. A. Sloane (njas(AT)research.att.com).
%E A001602 More terms from Jud McCranie (j.mccranie(AT)comcast.net)

Search completed in 0.002 seconds