Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054770
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A054770
%S A054770 2,6,9,13,17,20,24,27,31,35,38,42,46,49,53,56,60,64,67,71,74,78,82,85,
%T A054770 89,93,96,100,103,107,111,114,118,122,125,129,132,136,140,143,147,150,
%U A054770 154,158,161,165,169,172,176,179,183,187,190,194,197,201,205,208,212
%N A054770 Numbers that are not the sum of distinct Lucas numbers 1,3,4,7,11 ... 
               (A000204).
%C A054770 Alternatively, Lucas representation of n includes L_0 = 2. - W. F. Lunnon 
               (fred(AT)cs.may.ie), Aug 25, 2001
%F A054770 a_n = [((5+sqrt(5))/2)n]-1 (conjectured by David W. Wilson; proved by 
               Ian Agol (iagol(AT)math.ucdavis.edu), Jun 08, 2000)
%p A054770 A054770 := n -> floor(n*(sqrt(5)+5)/2)-1;
%o A054770 (PARI) a(n)=floor(n*(sqrt(5)+5)/2)-1
%Y A054770 Cf. A003263, A003622, A022342. Complement of A063732.
%Y A054770 Sequence in context: A083789 A003145 A047276 this_sequence A113689 A020960 
               A076522
%Y A054770 Adjacent sequences: A054767 A054768 A054769 this_sequence A054771 A054772 
               A054773
%K A054770 nonn,easy
%O A054770 1,1
%A A054770 Antreas P. Hatzipolakis (xpolakis(AT)otenet.gr), May 28 2000
%E A054770 More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 28 2000

    
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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research