Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090823
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090823 a(n)=(3/2)*(1/p)*(2*p+1)*(3^p+1)*B(2*p) where p=prime(n) and where B(k) denotes the k-th Bernoulli number. +0
1
61, 8205, 3440347021, 7080447489597, 171336855102372210685, 1747517658865390518778893, 610345691966794096778276272763149, 49983985045539556672075839852554462798428935229 (list; graph; listen)
OFFSET

3,1

COMMENT

a(n)==1 mod (prime(n))

LINKS

F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and A. R. Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence, J. Integer Sequences, Vol. 10 (2007), #07.1.2.

F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and A. R. Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence [pdf, ps].

PROGRAM

(PARI) a(n)=3/2/prime(n)*(2*prime(n)+1)*(3^prime(n)+1)*bernfrac(2*prime(n))

CROSSREFS

Sequence in context: A096544 A015288 A103915 this_sequence A093261 A062638 A099683

Adjacent sequences: A090820 A090821 A090822 this_sequence A090824 A090825 A090826

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 11 2004

page 1

Search completed in 0.004 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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research