Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131604
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131604 Primes of the form r(r(r(r(r(r(r(n)+1)+1)+1)+1)+1)+1)+1, where A141468(n) = r(n) = n-th nonprime. +0
1
2, 67, 71, 151, 157, 199, 257, 263, 277, 281, 311, 359, 373, 401, 461, 467, 499, 503, 521, 523, 541, 563, 571, 577, 613, 641, 661, 673, 677, 733, 739, 743, 761, 809, 829, 859, 863, 911, 929, 941, 967, 983, 991, 1019, 1031, 1051, 1063, 1093, 1103, 1123 (list; graph; listen)
OFFSET

1,1

EXAMPLE

If n = 1, then

r(r(r(r(r(r(r(1)+1)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(r(0+1)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(r(1)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(0+1)+1)+1)+1)+1)+1 = r(r(r(r(r(1)+1)+1)+1)+1)+1 = r(r(r(r(0+1)+1)+1)+1)+1 = r(r(r(r(1)+1)+1)+1)+1 = r(r(r(0+1)+1)+1)+1 = r(r(r(1)+1)+1)+1 = r(r(0+1)+1)+1 = r(r(1)+1)+1 = r(0+1)+1 = r(1)+1 = 0+1 = 1(nonprime).

If n = 2, then

r(r(r(r(r(r(r(2)+1)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(r(1+1)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(r(2)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(1+1)+1)+1)+1)+1)+1 = r(r(r(r(r(2)+1)+1)+1)+1)+1 = r(r(r(r(1+1)+1)+1)+1)+1 = r(r(r(r(2)+1)+1)+1)+1 = r(r(r(1+1)+1)+1)+1 = r(r(r(2)+1)+1)+1 = r(r(1+1)+1)+1 = r(r(2)+1)+1 = r(1+1)+1 = r(2)+1 = 1+1 = 2 = a(1).

If n = 3, then

r(r(r(r(r(r(r(3)+1)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(r(4+1)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(r(5)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(8+1)+1)+1)+1)+1)+1 = r(r(r(r(r(9)+1)+1)+1)+1)+1 = r(r(r(r(14+1)+1)+1)+1)+1 = r(r(r(r(15)+1)+1)+1)+1 = r(r(r(22+1)+1)+1)+1 = r(r(r(23)+1)+1)+1 = r(r(33+1)+1)+1 = r(r(34)+1)+1 = r(48+1)+1 = r(49)+1 = 66+1 = 67 = a(2).

If n = 4, then

r(r(r(r(r(r(r(4)+1)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(r(6+1)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(r(7)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(10+1)+1)+1)+1)+1)+1 = r(r(r(r(r(11)+1)+1)+1)+1)+1 = r(r(r(r(16+1)+1)+1)+1)+1 = r(r(r(r(17)+1)+1)+1)+1 = r(r(r(25+1)+1)+1)+1 = r(r(r(26)+1)+1)+1 = r(r(36+1)+1)+1 = r(r(37)+1)+1 = r(51+1)+1 = r(52)+1 = 70+1 = 71 = a(3).

If n = 5, then

r(r(r(r(r(r(r(5)+1)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(r(8+1)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(r(9)+1)+1)+1)+1)+1)+1 = r(r(r(r(r(14+1)+1)+1)+1)+1)+1 = r(r(r(r(r(15)+1)+1)+1)+1)+1 = r(r(r(r(22+1)+1)+1)+1)+1 = r(r(r(r(23)+1)+1)+1)+1 = r(r(r(33+1)+1)+1)+1 = r(r(r(34)+1)+1)+1 = r(r(48+1)+1)+1 = r(r(49)+1)+1 = r(66+1)+1 = r(67)+1 = 90+1 = 91(nonprime),

etc.

CROSSREFS

Cf. A000040, A141468.

Sequence in context: A016535 A139864 A107993 this_sequence A139861 A065721 A030472

Adjacent sequences: A131601 A131602 A131603 this_sequence A131605 A131606 A131607

KEYWORD

nonn

AUTHOR

Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Aug 25 2008

EXTENSIONS

211 removed, 355 replaced by 359 and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 05 2008

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