Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056188
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056188 Sum of binomial[n,k] as k runs over RRS[n], the reduced residue system of n. +0
3
1, 2, 6, 8, 30, 12, 126, 128, 342, 260, 2046, 1608, 8190, 4760, 15840, 32768, 131070, 80820, 524286, 493280, 1165542, 1391720, 8388606, 5769552, 26910650, 23153832, 89478486, 131849648, 536870910, 352845960, 2147483646, 2147483648 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)= Sum{binomial[n, k]; GCD[n, k]=1, 0<k<n}

EXAMPLE

n=prime, a(n)=2^n-2 because all k<=n except 0 and n are used; n=10, RRS[10]={1,3,7,9}, the corresponding coefficients are {10,120,120,10}, so the sum a(10)=260.

MATHEMATICA

f[n_] := Plus @@ Binomial[n, Select[ Range[n], GCD[n, # ] == 1 &]]; Table[ f[n], {n, 33}] (from Robert G. Wilson v Nov 04 2004)

CROSSREFS

Cf. A056045, A056189.

Adjacent sequences: A056185 A056186 A056187 this_sequence A056189 A056190 A056191

Sequence in context: A116083 A115506 A057852 this_sequence A020696 A132269 A053287

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Aug 02 2000

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research