login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A244923
Numbers n such that the digit sum of Fibonacci(n) is equal to the digit sum of Lucas(n).
1
1, 13, 61, 73, 97, 217, 349, 649, 937, 1477, 1513, 1729, 2005, 2077, 2209, 3265, 3649, 3889, 4093, 4609, 4945, 5497, 5749, 5929, 6109, 7309, 7441, 8041, 8389, 8821, 9925, 10525, 10669, 11605, 13201, 13345, 16021, 18529, 18649, 20293, 21481, 22573, 22729, 24169
OFFSET
1,2
COMMENTS
Numbers n such that A004090(n) = A139374(n).
Subsequence of A017533.
It seems that n is odd. The primes of the sequence are: 13, 61, 73, 97, 349, 937, 3889, 4093, 5749, 7309, 8389, 8821, 21481, 22573, 24169, ...
Fibonacci(j) == Lucas(j) (mod 9) iff j == 1 (mod 12), so all a(n) == 1 (mod 12). - Robert Israel, Jul 10 2014
LINKS
EXAMPLE
13 is in the sequence because Fibonacci(13) = 233, Lucas(13) = 521 and 2+3+3 = 5+2+1 = 8.
MATHEMATICA
lst={}; Table[If[Total[IntegerDigits[LucasL[n]]] == Total[IntegerDigits[Fibonacci[n]]], AppendTo[lst, n]], {n, 0, 25000}]; lst
Select[Range[25000], Total[IntegerDigits[Fibonacci[#]]]==Total[IntegerDigits[LucasL[#]]]&] (* Harvey P. Dale, Mar 31 2024 *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Michel Lagneau, Jul 08 2014
STATUS
approved