Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A160457
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A160457
%S A160457 2,1,2,5,10,17,26,37,50,65,82,101,122,145,170,197,226,257,290,325,362,
%T A160457 401,442,485,530,577,626,677,730,785,842,901,962,1025,1090,1157,1226,
%U A160457 1297,1370,1445,1522,1601,1682,1765,1850,1937,20,26,2117,2210,2305,2402
%N A160457 Competition number of the complete bipartite graph K_n,n.
%C A160457 Formula given on p. 3 of Sano.
%H A160457 Yoshio Sano, <a href="http://arxiv.org/abs/0905.1763">The competition 
               numbers of regular polyhedra</a>, May 12, 2009.
%F A160457 a(n) = n^2 - 2*n + 2, for nonnegative n.
%F A160457 a(n)=2*n+a(n-1)-5 (with a(1)=2) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), 
               Nov 08 2009]
%e A160457 a(11) = 11^2 - 2*11 + 2 = 101.
%e A160457 For n=2, a(2)=2*2+2-5=1; n=3, a(3)=2*3+1-5=2; n=4, a(4)=2*4+2-5=5 [From 
               Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 08 2009]
%Y A160457 Cf. A160450.
%Y A160457 Sequence in context: A129394 A049901 A117715 this_sequence A107087 A115141 
               A031148
%Y A160457 Adjacent sequences: A160454 A160455 A160456 this_sequence A160458 A160459 
               A160460
%K A160457 easy,nonn,new
%O A160457 0,1
%A A160457 Jonathan Vos Post (jvospost3(AT)gmail.com), May 14 2009
%E A160457 More terms a(27)-a(52) from Vincenzo Librandi (vincenzo.librandi(AT)tin.it), 
               Nov 08 2009

    
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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research