Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A013915
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A013915
%S A013915 3,3,7,10,16,24,37,57,89,140,222,354,567,911,1467,2366,3820,6172,9977,
%T A013915 16133,26093,42208,68282,110470,178731,289179,467887,757042,1224904,
%U A013915 1981920,3206797,5188689,8395457,13584116,21979542,35563626,57543135
%N A013915 a(n)=F(n)+L(n)+n, where F(n) (A000045) and L(n) (A000204) are Fibonacci 
               and Lucas numbers respectively.
%F A013915 a(n)=a(n-1)+a(n-2)-n+3.
%F A013915 a(n)= 3*a(n-1) -2*a(n-2) -a(n-3) +a(n-4). G.f.: (-3+6*x-4*x^2+2*x^3)/
               ((x^2+x-1) * (x-1)^2). a(n)=n+A013655(n). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 
               Nov 04 2009]
%Y A013915 Sequence in context: A075149 A161618 A157933 this_sequence A136445 A052989 
               A022403
%Y A013915 Adjacent sequences: A013912 A013913 A013914 this_sequence A013916 A013917 
               A013918
%K A013915 nonn,easy
%O A013915 0,1
%A A013915 Mohammad K. Azarian (ma3(AT)evansville.edu)
%E A013915 More terms from Erich Friedman (erich.friedman(AT)stetson.edu).

    
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