The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A020997 Numbers n such that the sum of the digits of Lucas(n) is n. 1
 1, 29, 43, 115, 124, 198, 431, 719, 979, 1496 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS No more terms < 200000. - Manfred Scheucher, Jun 12 2015 No more terms < 5400000. - Dana Jacobsen, Sep 07 2015 LINKS Manfred Scheucher, Sage Script David Terr, On the Sums of Digits of Fibonacci Numbers, Fibonacci Quarterly 34, Aug. 1996, pp. 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}] (* Robert G. Wilson v *) Select[Range[0, 10^4], Plus@@IntegerDigits[LucasL[#]]==#&] (* Vincenzo Librandi, Feb 18 2015 *) PROG (PARI) isok(n) = sumdigits(fibonacci(n+1)+fibonacci(n-1)) == n; \\ Michel Marcus, Feb 18 2015 (Perl) use ntheory ":all"; for (1..1e5) { say if \$_ == sumdigits(lucasv(1, -1, \$_)) } # Dana Jacobsen, Sep 06 2015 CROSSREFS Sequence in context: A043951 A042973 A323628 * A108280 A248429 A077782 Adjacent sequences: A020994 A020995 A020996 * A020998 A020999 A021000 KEYWORD nonn,base,more AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 23:05 EST 2022. Contains 358710 sequences. (Running on oeis4.)