login
This site is supported by donations to The OEIS Foundation.

 

Logo

The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

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
1, 7, 165, 227, 278, 322, 323, 385, 414, 433, 439, 634, 860, 964, 1045, 1268 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..16.

David Terr, On the Sums of Digits of Fibonacci Numbers, Fibonacci Quarterly 34, Aug. 1996, pp. 349-355.

PROG

(PARI) isok(n) = vecsum(digits(fibonacci(n+1)+fibonacci(n-1), 12)) == n; \\ Michel Marcus, Feb 18 2015

CROSSREFS

Cf. A020996.

Sequence in context: A169608 A184754 A160241 * A012504 A012689 A098632

Adjacent sequences:  A020995 A020996 A020997 * A020999 A021000 A021001

KEYWORD

nonn,base

AUTHOR

Sven Simon

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 30 08:46 EDT 2017. Contains 287302 sequences.