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!)
 A020996 Numbers k such that the sum of the digits of Fibonacci(k) in base 12 is k. 3
 0, 1, 5, 13, 14, 89, 96, 123, 221, 387, 419, 550, 648, 749, 866, 892, 1105, 2037 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS No more terms < 100000. - Manfred Scheucher, Aug 03 2015 LINKS Manfred Scheucher, Sage Script David Terr, On the Sums of Digits of Fibonacci Numbers, Fibonacci Quarterly 34, Aug. 1996, pp. 349-355. MAPLE filter:= proc(n) convert(convert(combinat:-fibonacci(n), base, 12), `+`)=n end proc: select(filter, [\$1..3000]); # Robert Israel, Aug 03 2015 PROG (PARI) isok(n) = vecsum(digits(fibonacci(n), 12)) == n; \\ Michel Marcus, Feb 18 2015 CROSSREFS Cf. A020995 (base 10), A025490 (base 11). Sequence in context: A291792 A292565 A174069 * A090759 A090758 A327922 Adjacent sequences: A020993 A020994 A020995 * A020997 A020998 A020999 KEYWORD nonn,base,more AUTHOR EXTENSIONS a(1)=0 inserted by Sean A. Irvine, May 06 2019 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 10 02:09 EST 2022. Contains 358712 sequences. (Running on oeis4.)