if n is composite, break it into its prime factors, if n is prime, place < > around n and replace n with the nth prime its is. the first 20 numbers then are... 1

<> 2

<<>> 3

<><> 4

<<<>>> 5

<><<>> 6

<<><>> 7

<><><> 8

<<>><<>> 9

<><<<>>> 10

<<<<>>>> 11

<><><<>> 12

<<><<>>> 13

<><<><>>14

<<>><<<>>> 15

<><><><> 16

<<<><>>> 17

<><<>><<>> 18

<<><><>> 19

<><><<<>>> 20

hypothesis:

1) there is no general method for adding recursive numbers.

2) numbers that differ by 1 wont differ in recursive representation by more than 2 brackets

3) symmetric recursive numbers, recursive numbers that can be represented in such a way that they are a mirror image at the middle, grow at a logarithmic rate somewhat similar to the primes.

## Question

## phil1882

if n is composite, break it into its prime factors, if n is prime, place < > around n and replace n with the nth prime its is. the first 20 numbers then are...

1

<> 2

<<>> 3

<><> 4

<<<>>> 5

<><<>> 6

<<><>> 7

<><><> 8

<<>><<>> 9

<><<<>>> 10

<<<<>>>> 11

<><><<>> 12

<<><<>>> 13

<><<><>>14

<<>><<<>>> 15

<><><><> 16

<<<><>>> 17

<><<>><<>> 18

<<><><>> 19

<><><<<>>> 20

hypothesis:

1) there is no general method for adding recursive numbers.

2) numbers that differ by 1 wont differ in recursive representation by more than 2 brackets

3) symmetric recursive numbers, recursive numbers that can be represented in such a way that they are a mirror image at the middle, grow at a logarithmic rate somewhat similar to the primes.

can you confirm or disprove any of these?

## Link to comment

## Share on other sites

## 7 answers to this question

## Recommended Posts

## Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.