Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073109
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073109 a(n) = prod( p<=n, p) * sum(k=1,n,B(k)*C(2k,k)) where B(k) is the k-th Bernoulli number and p denotes the odd primes. +0
1
0, 0, -7, -35, 295, 2065, -42980, -42980, 1426670, 15693370, -774856236, -10073131068, 692669409432, 692669409432, -63315621131763, -1076365559239971, 126262920264259779, 2398995485020935801, -351338708777824396629, -351338708777824396629 (list; graph; listen)
OFFSET

2,3

COMMENT

a(n)=a(n+1) for n=2, 8, 14, 20, 24, 26, 32, 34, 38, 44, 48, 50, 54, 56, 62, 64, 68, 74, 76, 80, 84, 86, 90, 92, 94, 98...it seems this si true for n=6k+2, n=10k+24, ...

PROGRAM

(PARI) a(n)=(1/2)*prod(i=1, n, i^isprime(i))*sum(k=1, n, bernfrac(k)*binomial(2*k, k))

CROSSREFS

Sequence in context: A096686 A165505 A165639 this_sequence A078235 A028389 A041603

Adjacent sequences: A073106 A073107 A073108 this_sequence A073110 A073111 A073112

KEYWORD

easy,sign

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 19 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 December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research