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!)
 A025491 In base 11, a(n) = sum of digits of Lucas(a(n)). 2

%I

%S 1,12,18,19,79,132,161,179,199,239,318,461,619,672,779,959,1098,1381,

%T 1499,1559,1579,1601,1621,1758,1859,1901,1981,2161,2179,2279,2519,

%U 2819,2839,2952,4019,4039,4261,4499,4601,4741,4859,5081,5118,5141,5658,5921

%N In base 11, a(n) = sum of digits of Lucas(a(n)).

%C Searched up to index 7500000. - _Sven Simon_, Sep 29 2006

%H Sven Simon, <a href="/A025491/b025491.txt">Table of n, a(n) for n = 1..284</a> [May be complete]

%Y Cf. A025490 (similar, with Fibonacci).

%K base,nonn

%O 1,2

%A _David W. Wilson_

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 6 19:33 EST 2022. Contains 358648 sequences. (Running on oeis4.)