Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120763
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120763 a(1) = 2. a(n) = a(n-1)*(largest prime occurring earlier in the sequence) - 1. +0
2
2, 3, 8, 23, 528, 12143, 147452448, 1790515076063, 21742224568633008, 264015832936910616143, 3205944259352905611824448, 38929781141322332844384272063, 472724332399077087729358215661008 (list; graph; listen)
OFFSET

1,1

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

Among the first 4 terms of the sequence, 23 is the largest prime. So a(5) = a(4)*23 -1 = 23*23 -1 = 528.

PROGRAM

(PARI) {m=13; print1(a=2, ", "); v=[a]; for(n=2, m, b=a; v=vecsort(v); j=#v; a=0; while(a<1, k=v[j]; if(isprime(k), print1(a=b*k-1, ", "); v=concat(v, a), j--)))} - (Klaus Brockhaus, Aug 17 2006)

CROSSREFS

Cf. A120762.

Sequence in context: A006076 A086628 A032096 this_sequence A120708 A089847 A038561

Adjacent sequences: A120760 A120761 A120762 this_sequence A120764 A120765 A120766

KEYWORD

nonn

AUTHOR

Leroy Quet Jul 03 2006

EXTENSIONS

More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 17 2006

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