A135968 -id:A135968 - cp's OEIS frontend

A135969 Sum of the prime factors of A135953(n).

150, 2974, 62158, 55946694, 2710261050, 555008010, 46165377746, 95396546, 92180471494910, 1665088321801550, 771601497990, 8242065051309594, 32530503217194, 272602401466814027806, 5568053048227732238014, 2811666624525811646469921614, 1966344318693363713266514

Offset: 1

Artur Jasinski, Dec 09 2007

nonn

A subsequence of A135968.

			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 *)

a(n) = A008472(A135953(n)). - R. J. Mathar, Nov 26 2008

Definition clarified by R. J. Mathar, Nov 26 2008

a(16)-a(17) from Amiram Eldar, Oct 23 2024

A135970 Fibonacci(Mersenne primes): a(n) = Fibonacci(A000668(n)).

Original entry on oeis.org

2, 13, 1346269, 155576970220531065681649693

Offset: 1

Artur Jasinski, Dec 09 2007

nonn

This sequence is a subsequence of A101342. The next term, a(5), has 1712 digits.

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 *)

cp's OEIS Frontend

A135969 Sum of the prime factors of A135953(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions