Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068595
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
0, 2, 9, 85, 1041, 15552, 274514, 5592406 (list; graph; listen)
OFFSET

1,2

COMMENT

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 this_sequence A037172 A135747 A132431

Adjacent sequences: A068592 A068593 A068594 this_sequence A068596 A068597 A068598

KEYWORD

nonn

AUTHOR

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

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research