A135958
a(n) = smallest prime p such that Fibonacci(p) has exactly n prime factors.
Original entry on oeis.org
2, 3, 19, 37, 97, 229, 503, 367, 971
Offset: 0
A135968
Sum of the distinct prime factors of the Fibonacci number A050937(n).
Original entry on oeis.org
0, 150, 2974, 2443, 62158, 55946694, 2710261050, 555008010, 1547031, 46165377746, 95396546, 92180471494910, 1665088321801550, 364125780, 771601497990, 518283023, 8242065051309594, 32530503217194, 272602401466814027806, 5568053048227732238014, 85526725052226871
Offset: 1
a(2) = 150 = 37+113 because A050937(2) = 4181 = 37*113.
a(3) = 2974 = 557 + 2417 because A050937(3) = 1346269 = 557*2417.
Cf.
A000045,
A001605,
A008472,
A050937,
A075737,
A090819,
A134787,
A134851,
A134852,
A135953,
A135954,
A135955,
A135956,
A135957,
A135958,
A135959,
A135969.
-
k = {}; Do[If[ ! PrimeQ[Fibonacci[Prime[n]]], b = FactorInteger[Fibonacci[Prime[n]]]; c =Length[FactorInteger[b]]; d = 0; Do[d = d + b[[r]][[1]], {r, 1, c}]; AppendTo[k, d]], {n, 1, 50}]; k
A135969
Sum of the prime factors of A135953(n).
Original entry on oeis.org
150, 2974, 62158, 55946694, 2710261050, 555008010, 46165377746, 95396546, 92180471494910, 1665088321801550, 771601497990, 8242065051309594, 32530503217194, 272602401466814027806, 5568053048227732238014, 2811666624525811646469921614, 1966344318693363713266514
Offset: 1
a(1) = 150 = 37+113 because A135953(1) = 4181 = 37*113.
a(2) = 2974 = 557+2417 because A135953(2) = 1346269 = 557*2417.
Cf.
A000045,
A001605,
A050937,
A075737,
A090819,
A134787,
A134851,
A134852,
A135953,
A135954,
A135955,
A135956,
A135957,
A135958,
A135959,
A135968.
-
k = {}; Do[If[ ! PrimeQ[Fibonacci[Prime[n]]], b = FactorInteger[Fibonacci[Prime[n]]]; c = Length[FactorInteger[b]]; If[c == 2, d = b[[1]][[1]] + b[[2]][[1]]; AppendTo[k, d]]], {n, 1, 50}]; k
Total[Transpose[FactorInteger[#]][[1]]]&/@Select[Fibonacci[Prime[ Range[50]]], PrimeOmega[#]==2&] (* Harvey P. Dale, Feb 18 2012 *)
A135960
Indices where records occur in A134852.
Original entry on oeis.org
1, 2, 4, 14, 37, 59, 144, 173
Offset: 1
Cf.
A000045,
A001605,
A050937,
A075737,
A090819,
A134787,
A134851,
A134852,
A135953,
A135954,
A135955,
A135956,
A135957,
A135958,
A135959.
A135970
Fibonacci(Mersenne primes): a(n) = Fibonacci(A000668(n)).
Original entry on oeis.org
2, 13, 1346269, 155576970220531065681649693
Offset: 1
Cf.
A000045,
A000668,
A001605,
A050937,
A075737,
A090819,
A134787,
A134851,
A134852,
A135953,
A135954,
A135955,
A135956,
A135957,
A135958,
A135959,
A135968,
A135969,
A101342.
-
k = {}; Do[If[PrimeQ[2^n - 1], AppendTo[k, Fibonacci[2^n - 1]]], {n, 1, 15}]; k
Fibonacci/@Select[Table[2^Prime[n]-1,{n,5}],PrimeQ] (* Harvey P. Dale, May 06 2018 *)
Showing 1-5 of 5 results.
Comments