Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000304
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A000304
%S A000304 2,3,6,18,108,1944,209952,408146688,85691213438976,
%T A000304 34974584955819144511488,2997014624388697307377363936018956288
%N A000304 a(n) = a(n-1) a(n-2).
%D A000304 Int. J. Math. Edu. Sci. Technol. Sergio Falcon, Fibonacci's multiplicative 
               sequence, 34-2 (2003), 310-315 [From Sergio Falcon (sfalcon(AT)dma.ulpgc.es), 
               Nov 23 2009]
%F A000304 For n>=4, a(n) = 2^A000045(n-3)*3^A000045(n-2) - Benoit Cloitre (benoit7848c(AT)orange.fr), 
               Sep 26 2003
%p A000304 A000304 := proc(n) option remember; if n <=3 then n else A000304(n-1)*A000304(n-2); 
               fi; end;
%p A000304 a[0]:=2: a[1]:=3: for n from 2 to 13 do a[n]:=a[n-1]*a[n-2] od: seq(a[n], 
               n=0..10);# [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 
               19 2009]
%Y A000304 Sequence in context: A072241 A093468 A114302 this_sequence A000614 A018290 
               A121959
%Y A000304 Adjacent sequences: A000301 A000302 A000303 this_sequence A000305 A000306 
               A000307
%K A000304 nonn,new
%O A000304 2,1
%A A000304 N. J. A. Sloane (njas(AT)research.att.com).

    
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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research