

A098833


Numbers n such that the sum of primes dividing n (with repetition) is a Fibonacci number.


1



1, 2, 3, 5, 6, 13, 15, 16, 18, 22, 38, 56, 63, 68, 75, 80, 89, 90, 93, 96, 106, 108, 145, 174, 195, 208, 231, 233, 234, 253, 275, 289, 330, 343, 352, 396, 490, 494, 588, 644, 664, 695, 700, 705, 747, 752, 834, 836, 840, 846, 884, 896, 916, 920, 945, 959, 1000, 1008
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Conjecture: there are infinitely many consecutive terms in this sequence. For example, sopfr(143335) = 377 and sopfr(143336) = 89 are both Fibonacci numbers.


LINKS



EXAMPLE

a(10)=22 because the sum of its prime factors is 13, the 7th
Fibonacci number.


MATHEMATICA

spdfibQ[n_]:=With[{fibs=Fibonacci[Range[30]]}, MemberQ[fibs, Total[ Times@@@ FactorInteger[ n]]]]; Select[Range[1100], spdfibQ] (* Harvey P. Dale, Nov 11 2022 *)


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



