Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073318
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073318 a(n)=2^g[n]-Sum[C(g(n),g(j))], where g is EulerPhi and j=0...n. +0
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; listen)
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: A103864 A152679 A165783 this_sequence A049449 A104663 A046202

Adjacent sequences: A073315 A073316 A073317 this_sequence A073319 A073320 A073321

KEYWORD

easy,sign

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jul 26 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research