Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083743
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083743 a(1) =1; if a(n-1) + n is prime then a(n) = a(n-1) + n, else a(n) = a(n-1). +0
3
1, 3, 3, 7, 7, 13, 13, 13, 13, 23, 23, 23, 23, 37, 37, 53, 53, 71, 71, 71, 71, 71, 71, 71, 71, 97, 97, 97, 97, 127, 127, 127, 127, 127, 127, 163, 163, 163, 163, 163, 163, 163, 163, 163, 163, 163, 163, 211, 211, 211, 211, 263, 263, 317, 317, 373, 373, 431, 431, 491 (list; graph; listen)
OFFSET

1,2

MAPLE

a := proc(n) option remember: if n=1 then RETURN(1) fi: if isprime(a(n-1)+n) then RETURN(a(n-1)+n) else RETURN(a(n-1)) fi: end: for n from 1 to 100 do printf(`%d, `, a(n)) od:

CROSSREFS

Sequence in context: A109579 A109580 A128508 this_sequence A126990 A128498 A086530

Adjacent sequences: A083740 A083741 A083742 this_sequence A083744 A083745 A083746

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 05 2003

EXTENSIONS

More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), May 19, 2003

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research