A023162 -id:A023162 - cp's OEIS frontend

A100992 Indices k of Fibonacci numbers F(k) (A000045) that are divisible by k+1.

10, 18, 28, 30, 40, 58, 60, 70, 78, 88, 100, 108, 130, 138, 148, 150, 178, 180, 190, 198, 210, 228, 238, 240, 250, 268, 270, 280, 310, 330, 348, 358, 378, 388, 400, 408, 418, 420, 430, 438, 441, 448, 460, 478, 490, 498, 508, 520, 540, 568, 570, 598, 600, 618

Offset: 1

Ron Knott, Nov 25 2004

nonn

When k+1 is prime, it is in A045468; when k+1 is composite (such as 442), it is in A069106. - T. D. Noe, Dec 13 2004

			18 is a term because F(18) = 2584 = 2*2*2*17*19 is divisible by 19, one more than its index number 18.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Ron Knott, Mathematical Magic of the Fibonacci Numbers.

Cf. A000045, A100993, A023162, A023173, A045468, A069106.

Select[ Range[ 620], Mod[ Fibonacci[ # ], # + 1] == 0 &] (* Robert G. Wilson v, Nov 26 2004 *)

More terms from Robert G. Wilson v, Nov 26 2004

A100993 Indices k of Fibonacci numbers F(k) (A000045) that are divisible by k-1.

Original entry on oeis.org

2, 3, 4, 8, 14, 18, 24, 38, 44, 48, 54, 68, 74, 84, 98, 104, 108, 114, 128, 138, 158, 164, 168, 174, 194, 198, 224, 228, 234, 258, 264, 278, 284, 294, 308, 314, 318, 324, 338, 348, 354, 368, 374, 378, 384, 398, 434, 444, 458, 464, 468, 488, 504, 524, 548, 558

Offset: 1

Ron Knott, Nov 25 2004

nonn

When k-1 is prime, it is in A003631; when k-1 is composite (such as 323), it is in A069107. - T. D. Noe, Dec 13 2004

			14 is a term because F(14) = 377 = 13*29 is divisible by 13, one less than its index number 14.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Ron Knott, Mathematical Magic of the Fibonacci Numbers.

Cf. A000045, A100992, A003631, A023162, A023173, A069104, A069107.

Select[Range[2, 500], Mod[ Fibonacci[ # ], # - 1] == 0 &] (* Robert G. Wilson v, Nov 26 2004 *)

a(n) = A069104(n) + 1. - T. D. Noe, Dec 13 2004

A128288 a(n) = A023163(n)/3 for n > 1.

Original entry on oeis.org

3, 13, 37, 43, 53, 67, 83, 107, 157, 163, 173, 197, 227, 277, 283, 293, 307, 317, 347, 373, 397, 443, 467, 523, 547, 557, 563, 587, 613, 643, 653, 677, 683, 733, 757, 773, 787, 797, 827, 853, 877, 883, 907, 947, 997, 1013, 1093, 1117, 1123, 1163, 1187, 1213

Offset: 2

Alexander Adamchuk, Feb 24 2007

nonn

3 divides A023163(n) for n > 1. A023163(n) are the numbers n such that Fibonacci(n) == -2 (mod n). Almost all terms of {a(n)} are prime that belong to A003631 = {2, 3, 7, 13, 17, 23, 37, 43, 47, 53, 67, 73, 83, 97} (primes congruent to {2, 3} mod 5) that are also the primes p that divide Fibonacci(p+1). The first composite term is a(74) = 1853 = 17*109. The second composite term is 9701 = 89*109. The third composite term is 10877 = 73*149 belong to A069107(n) Composite n such that n divides F(n+1) where F(k) are the Fibonacci numbers. Composite terms in {a(n)} are listed in A128289 = {1853, 9701, 10877, 17261, ...}.

			A023163 begins {1, 9, 39, 111, 129, 159, 201, 249, 321, 471, 489, 519, ...}.
Thus a(2) = A023163(2)/3 = 9/3 = 3, a(3) = A023163(3)/3 = 39/3 = 13.

Cf. A002708, A023172, A023173, A023162, A023163 (numbers k such that Fibonacci(k) == -2 (mod k)).

Cf. A003631, A069107, A128289 (composite terms in A128288).

a(n) = A023163(n)/3 for n > 1.

A128289 Composite terms in A128288(n) = A023163(n)/3 for n>1.

Original entry on oeis.org

1853, 9701, 10877, 17261, 23323, 27403, 75077, 80189, 113573, 120581, 161027, 162133, 163059, 196877, 213749, 291941, 361397, 400987, 427549, 482677, 635627, 667589, 941291, 1030373, 1033997, 1140701, 1196061, 1256293, 1751747, 1816363, 1842581, 2288453, 2662277

Offset: 1

Alexander Adamchuk, Feb 24 2007

nonn

3 divides A023163(n) for n>1. A023163(n) are the numbers n such that Fibonacci(n) == -2 (mod n).
Almost all terms of A128288 are prime that belong to A003631 = {2, 3, 7, 13, 17, 23, 37, 43, 47, 53, 67, 73, 83, 97} Primes congruent to {2, 3} mod 5; that are also the primes p that divide Fibonacci(p+1).
a(3) = 10877 = 73*149 belongs to A069107 Composite n such that n divides Fibonacci(n+1).
a(3) = 10877 and a(4) = 17261 belong to A094395 Odd composite n such that n divides Fibonacci(n) + 1.

			a(1) = A128288(74) = 1853 = 17*109.
a(2) = 9701 = 89*109.
a(3) = 10877 = 73*149.
a(4) = 17261 = 41*421.
a(5) = 23323 = 83*281.

Giovanni Resta, Table of n, a(n) for n = 1..1000

Cf. A128288, A002708, A023172, A023173, A023162, A023163 = numbers n such that Fib(n) == -2 (mod n). Cf. A003631, A069107, A094413, A094395 = Odd composite n such that n divides Fibonacci(n) + 1.

Do[ f = Mod[ Fibonacci[3n], 3n ]; If[ !PrimeQ[n] && f == 3n-2, Print[ {n, FactorInteger[n]} ]], {n,1,25000} ]

Two more terms from R. J. Mathar, Oct 08 2007

a(9)-a(33) from Amiram Eldar, Apr 07 2019

cp's OEIS Frontend

A100992 Indices k of Fibonacci numbers F(k) (A000045) that are divisible by k+1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A100993 Indices k of Fibonacci numbers F(k) (A000045) that are divisible by k-1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A128288 a(n) = A023163(n)/3 for n > 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Formula

A128289 Composite terms in A128288(n) = A023163(n)/3 for n>1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions