# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a147690
Showing 1-1 of 1

%I A147690 #7 May 05 2015 05:20:23
%S A147690 1,4,15,80,648,8437,177198,6024766,331362185,29491234554,
%T A147690 4246737775920,989489901789593,373037692974676938,
%U A147690 227552992714552932790,224594803809263744664717,358677901683394200229554646,926823697949890613393169207848
%N A147690 a(0)=1; thereafter a(n+1)=F(n+3)*a(n)+F(n+3) where F_n is Fibonacci's sequence 0,1,1,2,3,5,8, etc
%F A147690 a(n) ~ c * ((1 + sqrt(5))/2)^(n*(n+5)/2) / 5^(n/2), where c = 2.8108236954842730572761317698844943576850363911506448409307848569379046... . - _Vaclav Kotesovec_, May 05 2015
%t A147690 RecurrenceTable[{a[0]==1,a[n+1]==Fibonacci[n+3]*(a[n]+1)},a,{n,0,20}] (* _Vaclav Kotesovec_, May 05 2015 *)
%o A147690 (PARI) fa(n) = if (n == 0, 1,  fibonacci(n+2) * (fa(n-1) + 1)); \\ _Michel Marcus_, Sep 05 2013
%K A147690 nonn
%O A147690 0,2
%A A147690 Andrew-David Bjork (abjork(AT)math.uci.edu), Nov 10 2008

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE