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

 

Logo

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!)
A020998 Numbers n such that the sum of the digits of Lucas(n) in base 12 is n. 1

%I

%S 1,7,165,227,278,322,323,385,414,433,439,634,860,964,1045,1268

%N Numbers n such that the sum of the digits of Lucas(n) in base 12 is n.

%H David Terr, <a href="http://www.fq.math.ca/Scanned/34-4/terr.pdf">On the Sums of Digits of Fibonacci Numbers,</a> Fibonacci Quarterly 34, Aug. 1996, pp. 349-355.

%o (PARI) isok(n) = vecsum(digits(fibonacci(n+1)+fibonacci(n-1), 12)) == n; \\ _Michel Marcus_, Feb 18 2015

%Y Cf. A020996.

%K nonn,base

%O 1,2

%A _Sven Simon_

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 10:23 EST 2022. Contains 358630 sequences. (Running on oeis4.)