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
A160457 Competition number of the complete bipartite graph K_n,n. +0
2
2, 1, 2, 5, 10, 17, 26, 37, 50, 65, 82, 101, 122, 145, 170, 197, 226, 257, 290, 325, 362, 401, 442, 485, 530, 577 (list; graph; listen)
OFFSET

0,1

COMMENT

Formula given on p. 3 of Sano.

LINKS

Yoshio Sano, The competition numbers of regular polyhedra, May 12, 2009.

FORMULA

a(n) = n^2 - 2*n + 2, for nonnegative n.

EXAMPLE

a(11) = 11^2 - 2*11 + 2 = 101.

CROSSREFS

Cf. A160450.

Adjacent sequences: A160454 A160455 A160456 this_sequence A160458 A160459 A160460

Sequence in context: A129394 A049901 A117715 this_sequence A107087 A115141 A031148

KEYWORD

easy,nonn,more

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), May 14 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 November 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research