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!)
A116479 Maximum number of Fibonacci parts possible in a factorization of n. 0

%I #2 Mar 30 2012 18:40:02

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

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

%U 1,2,3,3,2,3,1,2,1,4,2,2,2,4,1,4,2,3,2,2,2,6,1,3,3,4,1,3

%N Maximum number of Fibonacci parts possible in a factorization of n.

%Y Cf. A086436.

%K easy,nonn

%O 1,4

%A _Giovanni Teofilatto_, Apr 01 2006

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 19 12:14 EDT 2024. Contains 371792 sequences. (Running on oeis4.)