Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095001
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095001 a(n) = sum, over divisors d of n, of A007947(d)^(n/d), where A007947(d) is the square-free kernel of d. +0
2
1, 3, 4, 7, 6, 24, 8, 23, 31, 68, 12, 196, 14, 192, 384, 279, 18, 1473, 20, 1792, 2552, 2192, 24, 12068, 3131, 8388, 19714, 19124, 30, 116474, 32, 65815, 178512, 131396, 94968, 841093, 38, 524688, 1596560, 1450368, 42, 7280934, 44, 4211500, 16305666 (list; graph; listen)
OFFSET

1,2

FORMULA

G.f. satisfies: A(x) = Sum_{n>=1} [1/(1-A007947(n)*x^n) - 1]. a(n) = Sum_{d|n} A007947(d)^(n/d); a(p) = p+1, for prime p.

PROGRAM

(PARI) {a(n)=sumdiv(n, d, prod(i=1, omega(d), factor(d)[i, 1])^(n/d))} /* also formed by the log of G094947(x): */ {a(n)=n*polcoeff(sum(k=1, n, -log(1-prod(i=1, omega(k), factor(k)[i, 1])*x^k+x*O(x^n))/k), n)}

CROSSREFS

Cf. A094947.

Sequence in context: A069213 A130700 A117134 this_sequence A068905 A021746 A081826

Adjacent sequences: A094998 A094999 A095000 this_sequence A095002 A095003 A095004

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), May 26 2004

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research