Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027000
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A027000
%S A027000 1,13,54,171,487,1324,3525,9297,24418,64015,167691,439128,1149769,
%T A027000 3010261,7881102,20633139,54018415,141422212,370248333,969322905,
%U A027000 2537720506,6643838743
%N A027000 Lucas(2n+3) - (6n+4).
%F A027000 4*F(2n-1) + 7*F(2n) - 6n - 4, with F(n) = A000045(n) (Fibonacci). - Ralf 
               Stephan, Feb 07 2004
%Y A027000 T(2n, n+1), T given by A026998.
%Y A027000 Sequence in context: A142188 A156156 A071230 this_sequence A029531 A158485 
               A005902
%Y A027000 Adjacent sequences: A026997 A026998 A026999 this_sequence A027001 A027002 
               A027003
%K A027000 nonn
%O A027000 1,2
%A A027000 Clark Kimberling (ck6(AT)evansville.edu)

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


AT&T Labs Research