|
%I #11 Feb 18 2015 04:01:17
%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_
|
