Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104536
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104536 Let q(b-1)=k(b)*q(b)^p(b)-1 for b=n to 1, where q(n)=p(n+1), with p(x) as the x-th prime. If k(b) is the minimum positive integer that makes q(b-1) prime, then a(n)=q(0). +0
3
17, 3486013, 95546861187714408803829067490017, 11521371769146027198878540116068812681880419688486700618357345699743923465881941\ 31997252117654080689443304002035837020246444691555048358809796164736790815726144\ 90803907538033506190375184720051744203947305577550777446858943708031494162097389\ 34082646247291 (list; graph; listen)
OFFSET

1,1

COMMENT

a(5) has 2884 digits.

EXAMPLE

if n=3, then p(n+1)=p(4)=7.

when b=3, q(b)=q(3)=p(4)=7 and k(b)=2 and p(b)=p(3)=5, then q(b-1)=q(2)=2*7^5-1=33613

when b=2, q(b)=q(2)=33613 and k(b)=26 and p(b)=p(2)=3, then q(b-1)=q(1)=26*33613^3-1=987404664412321

when b=1, q(b)=q(1)=987404664412321 and k(b)=98 and p(b)=p(1)=2, then q(b-1)=q(0)=98*987404664412321^3-1=95546861187714408803829067490017

then a(3)=q(0)=95546861187714408803829067490017

CROSSREFS

Sequence in context: A125041 A013806 A147671 this_sequence A013882 A157255 A114432

Adjacent sequences: A104533 A104534 A104535 this_sequence A104537 A104538 A104539

KEYWORD

nonn

AUTHOR

Ray G. Opao (1260(AT)email.com), Apr 20 2005

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research