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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073318 a(n)=2^g[n]-Sum[C(g(n),g(j))], where g is EulerPhi and j=0...n. 3
0, -1, -2, -3, -6, -4, -10, -13, -26, -14, -183, -15, -22, -57, -210, -211, -1730, -58, 25160, -240, -3356, -949, 238031, -241, -256823, -3918, -143243, -3919, 46326924, -242, 281620682, -61817, -639769, -61818, -4718174, -4415, 2023569890, -224436, -7556927, -63639, -43279525745, -4416 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

a(n)=A066781(n)-A073317(n)

EXAMPLE

a(n)>0 for {19,23,29,31,37,43,53,59,61,67,71,73,79,83,89,97} This holds only for special primes?

MATHEMATICA

g[x_] := EulerPhi[x] Table[Apply[Plus, Table[Binomial[g[n], g[j]], {j, 0, n}]], {n, 1, 50}]

CROSSREFS

Cf. A066781, A073318.

Sequence in context: A152679 A194357 A165783 * A049449 A104663 A046202

Adjacent sequences:  A073315 A073316 A073317 * A073319 A073320 A073321

KEYWORD

easy,sign

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 26 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 15 18:22 EST 2012. Contains 205835 sequences.