Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116479
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A116479
%S A116479 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,1,
%T A116479 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,1,2,
%U A116479 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 A116479 Maximum number of Fibonacci parts possible in a factorization of n.
%Y A116479 Cf. A086436.
%Y A116479 Sequence in context: A055181 A073811 A125030 this_sequence A122810 A086436 
               A001222
%Y A116479 Adjacent sequences: A116476 A116477 A116478 this_sequence A116480 A116481 
               A116482
%K A116479 easy,nonn
%O A116479 1,4
%A A116479 Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Apr 01 2006

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research