[seqfan] Re: from Steven Finch about A087687

[franktaw at netscape.net]

Note that A087687 has the "mult" keyword, which says that it is 
multiplicative.

Franklin T. Adams-Watters


-----Original Message-----
From: Olivier Gerard <olivier.gerard at gmail.com>

To seqfan members: if you reply to this message,
please be sure to put Steven Finch in copy, as he
is not currently subscribed to the list.

Olivier

From: Steven Finch <sfinch9 at hotmail.com>
Date: Sun, 25 Jan 2009 20:55:11 -0500
Subject: A087687

Hello!

I believe that a(n), as defined by A087687, is a multiplicative 
function.
It seems clear that a(p)=p^2 for any prime p, a(4)=8, a(8)=32 and

a(p^2)=p^2*(p^2+p-1),    a(p^3)=p^4*(p^2+p-1)

for any odd prime.  Formulas for a(p^k) for k>=3 seem to be hard to
find.  Does anyone know how to do this?  Thank you!

Steve Finch
http://algo.inria.fr/bsolve/