1,2
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.
sci.math thread
Sequence in context: A120959 A125797 A106163 this_sequence A037172 A135747 A132431
Adjacent sequences: A068592 A068593 A068594 this_sequence A068596 A068597 A068598
nonn
John W. Layman (layman(AT)math.vt.edu), Mar 13 2002
Search completed in 0.002 seconds