Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118073
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118073 Nonprimes of the form r(r(r(r(r(r(n)+1)+1)+1)+1)+1)+1, where A141468(n)=r(n)=n-th non-prime. +0
1
1, 49, 52, 70, 86, 91, 94, 95, 116, 118, 121, 124, 125, 133, 135, 154, 160, 161, 162, 165, 172, 175, 177, 185, 195, 203, 207, 208, 219, 222, 225, 236, 248, 250, 253, 255, 257, 261, 262, 267, 275, 286, 288, 298, 300, 301, 306, 315, 319, 321, 323, 326, 327, 328 (list; graph; listen)
OFFSET

1,2

EXAMPLE

If n=1, then

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=a(1).

If n=2, then

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

(prime).

If n=3, then

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

If n=4, then

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

If n=5, then

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

(prime).

If n=6, then

r(r(r(r(r(r(6)+1)+1)+1)+1)+1)+1=r(r(r(r(r(9+1)+1)+1)+1)+1)+1=r(r(r(r(r(10)+1)+1)+1)+1)+1=r(r(r(r(15+1)+1)+1)+1)+1=r(r(r(r(16)+1)+1)+1)+1=r(r(r(24+1)+1)+1)+1=r(r(r(25)+1)+1)+1=r(r(35+1)+1)+1=r(r(36)+1)+1=r(50+1)+1=r(51)+169+1=70=a

(4).

If n=7, then

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

(prime).

If n=8, then

r(r(r(r(r(r(8)+1)+1)+1)+1)+1)+1=r(r(r(r(r(12+1)+1)+1)+1)+1)+1=r(r(r(r(r(13)+1)+1)+1)+1)+1=r(r(r(r(20+1)+1)+1)+1)+1=r(r(r(r(21)+1)+1)+1)+1=r(r(r(30+1)+1)+1)+1=r(r(r(31)+1)+1)+1=r(r(44+1)+1)+1=r(r(45)+1)+1=r(62+1)+1=r(63)+1=85+1=86=a

(5).

If n=9, then

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=a(6),

etc

CROSSREFS

Cf. A000040, A141468.

KEYWORD

nonn,new

AUTHOR

Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Aug 25 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 September 6 09:40 EDT 2008. Contains 143480 sequences.


AT&T Labs Research