login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068595 Number of functions from {1,2,...,n} to {1,2,...,n} such that the sum of the function values is 0 mod 3. 0
0, 2, 9, 85, 1041, 15552, 274514, 5592406 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

It appears that a(n)=Floor[(n^n)/2] for n>2. If the functions counted are those whose sum of values is 0 mod 2 (instead of 0 mod 3) it appears that we get A057065.

LINKS

sci.math thread

CROSSREFS

Sequence in context: A120959 A125797 A106163 * A037172 A135747 A132431

Adjacent sequences:  A068592 A068593 A068594 * A068596 A068597 A068598

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Mar 13 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 11:30 EST 2012. Contains 206011 sequences.