Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007486
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A007486 M2351
%S A007486 1,3,4,8,15,27,50,92,169,311,572,1052,1935,3559,6546,12040,
%T A007486 22145,40731,74916,137792,253439,466147,857378,1576964,2900489,
%U A007486 5334831,9812284,18047604,33194719,61054607,112296930,206546256
%N A007486 a(n) = a(n-1)+a(n-2)+a(n-3).
%C A007486 If A001590 is the Tribonacci series, this might be called the Trucas 
               series after the Lucas series A000032. - Paul Wayper (paulway(AT)mabula.net), 
               Nov 28 2007
%D A007486 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%F A007486 O.g.f.: x(1+2x)/(1-x-x^2-x^3). a(n)=A001590(n)+3*A000073(n). [From R. 
               J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 22 2008]
%Y A007486 Cf. A001590, A000032, A000045.
%Y A007486 Sequence in context: A104370 A033854 A042981 this_sequence A027977 A165438 
               A049894
%Y A007486 Adjacent sequences: A007483 A007484 A007485 this_sequence A007487 A007488 
               A007489
%K A007486 nonn
%O A007486 1,2
%A A007486 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 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research