Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131649
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131649 Number of distinct improper 2-coloring of edges for odd-order cyclic graphs. +0
1
4, 8, 16, 32, 54, 82, 116, 156, 202, 254, 312, 376, 446, 522, 604 (list; graph; listen)
OFFSET

3,1

MATHEMATICA

Table[If[n == 3, n + 1, If[n == 5, n + 3, 1/2 (13 - 5 n) + 3/4 (-1 + n)^2]], {n, 3, 31, 2}]

CROSSREFS

Sequence in context: A088259 A123857 A048168 this_sequence A003199 A007096 A036313

Adjacent sequences: A131646 A131647 A131648 this_sequence A131650 A131651 A131652

KEYWORD

full,nonn

AUTHOR

M. Razid Black (mrazidblack(AT)hotmail.com), Sep 10 2007

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 01:16 EST 2008. Contains 151161 sequences.


AT&T Labs Research