Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055268
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A055268
%S A055268 1,15,65,185,420,826,1470,2430,3795,5665,8151,11375,15470,20580,26860,
%T A055268 34476,43605,54435,67165,82005,99176,118910,141450,167050,195975,
%U A055268 228501,264915,305515,350610,400520,455576,516120,582505,655095,734265
%N A055268 A second order recursive sequence.
%D A055268 I. Adler, Three Diophantine equations - Part II, Fib. Quart., 7 (1969), 
               pps. 181-193.
%D A055268 A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, 
               pps. 122-125, 194-196.
%D A055268 E. I. Emerson, Recurrent Sequences in the Equation DQ^2=R^2+N, Fib. Quart.,
               7 (1969), pps. 231-242.
%F A055268 a(n)=(11n+4)*C(n+3, 3)/4.
%Y A055268 Cf. A000292 and A050441.
%Y A055268 Sequence in context: A005917 A027455 A152729 this_sequence A090026 A027526 
               A033653
%Y A055268 Adjacent sequences: A055265 A055266 A055267 this_sequence A055269 A055270 
               A055271
%K A055268 easy,nonn
%O A055268 0,2
%A A055268 Barry E. Williams, May 10 2000

    
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 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research