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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107260 Number of Lucas numbers needed to sum up to n. 0

%I #2 Mar 30 2012 18:41:21

%S 1,1,1,1,2,2,1,2,2,2,1,3,2,2,2,3,3,1,3,2,2,2,3,3,2,3,3,3,1,4,2,2,2,3,

%T 3,2,3,3,3,2,4,3,3,3,4,4,1,4,2,2,2,3,3,2,3,3,3,2,4,3,3,3,4,4,2,4,3,3,

%U 3,4,4,3,4,4,4,1,5,2,2,2,3,3,2,3,3,3,2,4,3,3,3,4,4,2,4,3,3,3,4,4,3,4

%N Number of Lucas numbers needed to sum up to n.

%C Cf. A007895. Record positions are in A002878 + 1.

%K nonn

%O 2,5

%A _Ralf Stephan_, May 15 2005

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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)