|
Search: id:A020997
|
|
|
| A020997 |
|
Numbers n such that sum of digits of Lucas(n) is n. |
|
+0
1
|
| |
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
David Terr, Fibonacci Quarterly, August 1996, page 349-355.
|
|
MATHEMATICA
|
Do[ If[ Mod[ 2Fibonacci[n + 1] - Fibonacci[n], 9] == Mod[n, 9], If[ Plus @@ IntegerDigits[ 2Fibonacci[n + 1] - Fibonacci[n]] == n, Print[n]]], {n, 0, 10^5}] (from Robert G. Wilson v)
|
|
CROSSREFS
|
Sequence in context: A043171 A043951 A042973 this_sequence A108280 A077782 A059414
Adjacent sequences: A020994 A020995 A020996 this_sequence A020998 A020999 A021000
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
Sven-H.Simon(AT)t-online.de (Sven Simon)
|
|
|
Search completed in 0.002 seconds
|
