Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A158569
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A158569
%S A158569 1,1,2,4,12,54,609,28656,14930351,365435296161,4660046610375530308,
%T A158569 1454489111232772683678306641952,
%U A158569 5789092068864820527338372482892113982249794889764
%N A158569 a(n)=Sum_{i=1..F(n)} F(i). n>=1. F(k) is A000045, Fibonacci numbers.
%C A158569 a(14) has 79 digits. [From Emeric Deutsch (deutsch(AT)duke.poly.edu), 
               Apr 05 2009]
%p A158569 with(combinat); a := proc (n) options operator, arrow: add(fibonacci(i), 
               i = 1 .. fibonacci(n)) end proc: seq(a(n), n = 1 .. 13); [From Emeric 
               Deutsch (deutsch(AT)duke.poly.edu), Apr 05 2009]
%Y A158569 Cf. A000045
%Y A158569 Sequence in context: A030831 A058767 A075876 this_sequence A020106 A099928 
               A000568
%Y A158569 Adjacent sequences: A158566 A158567 A158568 this_sequence A158570 A158571 
               A158572
%K A158569 easy,nonn
%O A158569 1,3
%A A158569 Ctibor O. Zizka (c.zizka(AT)email.cz), Mar 21 2009
%E A158569 More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 05 2009

    
page 1

Search completed in 0.002 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