Count up with recursive prime factorization
Moderators: jestingrabbit, Moderators General, Prelates

 Posts: 35
 Joined: Mon Nov 03, 2014 9:33 pm UTC
Re: Count up with recursive prime factorization
491
<<><<<>><<<>>>>>
(o(⊙(⊙)))
(a(b(b)))
12234345
<<><<<>><<<>>>>>
(o(⊙(⊙)))
(a(b(b)))
12234345
I QUIT
 phillip1882
 Posts: 145
 Joined: Fri Jun 14, 2013 9:11 pm UTC
 Location: geogia
 Contact:
Re: Count up with recursive prime factorization
just for giggles i created a recursive number program.
492 = <><><<>><<<><<>>>>
efficiency: 64.55
Code: Select all
recurse = [""]*1000000
recurse[2] = "<>"
n = 2
p = 1
while n < len(recurse):
for v in range(2,int(len(recurse)/n)):
if recurse[v] != "":
recurse[v*n] = recurse[v] +recurse[n]
n += 1
while n<len(recurse) and recurse[n] != "":
n += 1
if n == len(recurse):
break
p += 1
recurse[n] = "<" +recurse[p] +">"
print(recurse[492])
492 = <><><<>><<<><<>>>>
efficiency: 64.55
good luck have fun

 Posts: 35
 Joined: Mon Nov 03, 2014 9:33 pm UTC
Re: Count up with recursive prime factorization
494
<><<><<>>><<><><>>
a<ab><aaa>
p1p<p1pp1>p<p1p1p1>
112123211112
Prime: No
Symmetrical: No
Alphabetical: No
Length: 18
Reversals: 11
Max Depth: 3
Factors: 3
Smoothness: 19
Necessary Brackets: 4
<><<><<>>><<><><>>
a<ab><aaa>
p1p<p1pp1>p<p1p1p1>
112123211112
Code: Select all
* *** *****
* * * * *
*
Prime: No
Symmetrical: No
Alphabetical: No
Length: 18
Reversals: 11
Max Depth: 3
Factors: 3
Smoothness: 19
Necessary Brackets: 4

 Posts: 35
 Joined: Mon Nov 03, 2014 9:33 pm UTC
Re: Count up with recursive prime factorization
495
<<>><<>><<<>>><<<<>>>>
⊙⊙(⊙)((⊙))
bbcd
12121231234
<<>><<>><<<>>><<<<>>>>
^
(OXOX⊙X(⊙))
v
(OXOX⊙X(⊙))
v
⊙⊙(⊙)((⊙))
bbcd
12121231234
Code: Select all
* * * *
* * * *
* * *
* *
I QUIT
Re: Count up with recursive prime factorization
496
<><><><><<<<<>>>>>
aaaae
p1p1p1p1ppppp1
1111111155
Prime: No
Symmetrical: Yes
Alphabetical: Yes
Length: 18
Reversals: 9
Max Depth: 5
Factors: 5
Smoothness: 31
Necessary Brackets: 0
<><><><><<<<<>>>>>
aaaae
p1p1p1p1ppppp1
1111111155
Code: Select all
* * * * *
*
*
*
*
Prime: No
Symmetrical: Yes
Alphabetical: Yes
Length: 18
Reversals: 9
Max Depth: 5
Factors: 5
Smoothness: 31
Necessary Brackets: 0

 Posts: 35
 Joined: Mon Nov 03, 2014 9:33 pm UTC
Re: Count up with recursive prime factorization
497
7{2{1}*2{1}}*71{2{1}*2{1}*5{3{2{1}}}}
<<><>><<><><<<>>>>
(oo)(oo(⊙))
<aa><aab>
12212223
7{2{1}*2{1}}*71{2{1}*2{1}*5{3{2{1}}}}
<<><>><<><><<<>>>>
(oo)(oo(⊙))
<aa><aab>
12212223
Code: Select all
*** *****
* * * * *
*
I QUIT
 firesoul31
 Posts: 93
 Joined: Wed Feb 27, 2013 10:30 pm UTC
Re: Count up with recursive prime factorization
p1pp1pp<pp1pp1>
<><<>><<<<>><<>>>>
498
<><<>><<<<>><<>>>>
498
Pronouns: she/her/hers or they/them please.
 phillip1882
 Posts: 145
 Joined: Fri Jun 14, 2013 9:11 pm UTC
 Location: geogia
 Contact:
Re: Count up with recursive prime factorization
<<<<>>><<><><>>> 499
efficiency: 66.52%
efficiency: 66.52%
good luck have fun
Re: Count up with recursive prime factorization
500
<><><<<>>><<<>>><<<>>>
aaccc
p1p1ppp1ppp1ppp1
1111333333
Prime: No
Symmetrical: Yes
Alphabetical: Yes
Length: 22
Reversals: 9
Max Depth: 3
Factors: 5
Smoothness: 5
Necessary Brackets: 0
<><><<<>>><<<>>><<<>>>
aaccc
p1p1ppp1ppp1ppp1
1111333333
Code: Select all
* * * * *
* * *
* * *
Prime: No
Symmetrical: Yes
Alphabetical: Yes
Length: 22
Reversals: 9
Max Depth: 3
Factors: 5
Smoothness: 5
Necessary Brackets: 0
 Vytron
 Posts: 432
 Joined: Mon Oct 19, 2009 10:11 am UTC
 Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P
Re: Count up with recursive prime factorization
⊙
^
⊙
<^>
<O>
VV
^
⊙
<^>
<O>
VV
501
Re: Count up with recursive prime factorization
502
<><<><<>><<>><<>>>
a<abbb>
p1p<p1pp1pp1pp1>
1121222223
Prime: No
Symmetrical: No
Alphabetical: No
Length: 18
Reversals: 9
Max Depth: 3
Factors: 2
Smoothness: 251
Necessary Brackets: 2
<><<><<>><<>><<>>>
a<abbb>
p1p<p1pp1pp1pp1>
1121222223
Code: Select all
* *******
* * * *
* * *
Prime: No
Symmetrical: No
Alphabetical: No
Length: 18
Reversals: 9
Max Depth: 3
Factors: 2
Smoothness: 251
Necessary Brackets: 2
 Vytron
 Posts: 432
 Joined: Mon Oct 19, 2009 10:11 am UTC
 Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P
Re: Count up with recursive prime factorization
<^>
۞
<v>
۞
<v>
503
Re: Count up with recursive prime factorization
504
<><><><<>><<>><<><>>
aaabb<aa>
p1p1p1pp1pp1p<p1p1>
11111122222112
Prime: No
Symmetrical: No
Alphabetical: No
Length: 20
Reversals: 13
Max Depth: 2
Factors: 6
Smoothness: 7
Necessary Brackets: 2
(Even after 3 weeks, this thread seems to be going much faster than 'Count up in a somewhat complex way')
<><><><<>><<>><<><>>
aaabb<aa>
p1p1p1pp1pp1p<p1p1>
11111122222112
Code: Select all
* * * * * ***
* * * *
Prime: No
Symmetrical: No
Alphabetical: No
Length: 20
Reversals: 13
Max Depth: 2
Factors: 6
Smoothness: 7
Necessary Brackets: 2
(Even after 3 weeks, this thread seems to be going much faster than 'Count up in a somewhat complex way')
 Vytron
 Posts: 432
 Joined: Mon Oct 19, 2009 10:11 am UTC
 Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P
Re: Count up with recursive prime factorization
Λ
◇
^
o
⊙
VV
[[[]]]
505
Re: Count up with recursive prime factorization
506
<><<<<>>>><<<>><<>>>
ad<bb>
p1pppp1p<pp1pp1>
11443223
Prime: No
Symmetrical: No
Alphabetical: No
Length: 20
Reversals: 7
Max Depth: 4
Factors: 3
Smoothness: 23
Necessary Brackets: 2
<><<<<>>>><<<>><<>>>
ad<bb>
p1pppp1p<pp1pp1>
11443223
Code: Select all
* * ***
* * *
* * *
*
Prime: No
Symmetrical: No
Alphabetical: No
Length: 20
Reversals: 7
Max Depth: 4
Factors: 3
Smoothness: 23
Necessary Brackets: 2
 phillip1882
 Posts: 145
 Joined: Fri Jun 14, 2013 9:11 pm UTC
 Location: geogia
 Contact:
Re: Count up with recursive prime factorization
<<>><<><<>>><<><<>>> 507
efficiency: 63.03%
efficiency: 63.03%
good luck have fun
Re: Count up with recursive prime factorization
Vytron on page 7 wrote:Just fixed all my counts of previous page.O
<<<<<>>>>>
254
O
<<<<<>>>>>
O
<<<<<>>>>>
O
508
afa (abcext. bnot.)
<><<<<<<>>>>>><> (st. bnot.)
Code: Select all
* * *
*
*
*
*
*
Symmetric, alphabetic, and composite. 2^{7}1smooth, though, so not really smooth at all. (a=2,b=3,c=5,d=11,e=31,f=127)
(Labyrinthnot.)
Re: Count up with recursive prime factorization
509
<<<<<>>><<<>>>>>
<<cc>>
p<p<ppp1ppp1>>
5335
Prime: Yes
Symmetrical: Yes
Alphabetical: No
Length: 16
Reversals: 3
Max Depth: 5
Factors: 1
Smoothness: 509
Necessary Brackets: 4
<<<<<>>><<<>>>>>
<<cc>>
p<p<ppp1ppp1>>
5335
Code: Select all
***
***
* *
* *
* *
Prime: Yes
Symmetrical: Yes
Alphabetical: No
Length: 16
Reversals: 3
Max Depth: 5
Factors: 1
Smoothness: 509
Necessary Brackets: 4
 Vytron
 Posts: 432
 Joined: Mon Oct 19, 2009 10:11 am UTC
 Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P
Re: Count up with recursive prime factorization
Vytron wrote:
〇〇
<<〇>>
<<〇〇>>
340
(/2 *3)
〇
<〇>
<<〇>>
<<〇〇>>
<〇>
<<〇>>
<<〇〇>>
510
 phillip1882
 Posts: 145
 Joined: Fri Jun 14, 2013 9:11 pm UTC
 Location: geogia
 Contact:
Re: Count up with recursive prime factorization
<<><>><<<>><<><>>> 511
efficiency: 64.77%
efficiency: 64.77%
good luck have fun
Re: Count up with recursive prime factorization
512
<><><><><><><><><>
aaaaaaaaa
p1p1p1p1p1p1p1p1p1
111111111111111111
Prime: No
Symmetrical: Yes
Alphabetical: Yes
Length: 18
Reversals: 17
Max Depth: 1
Factors: 9
Smoothness: 2
Necessary Brackets: 0
Power of 2
<><><><><><><><><>
aaaaaaaaa
p1p1p1p1p1p1p1p1p1
111111111111111111
Code: Select all
* * * * * * * * *
Prime: No
Symmetrical: Yes
Alphabetical: Yes
Length: 18
Reversals: 17
Max Depth: 1
Factors: 9
Smoothness: 2
Necessary Brackets: 0
Power of 2
 Vytron
 Posts: 432
 Joined: Mon Oct 19, 2009 10:11 am UTC
 Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P
Re: Count up with recursive prime factorization
<∙>
<∙><∴><∙>
<∙><∴><∙>
513
Re: Count up with recursive prime factorization
514
<><<<<>>><<<<>>>>>
a<cd>
p1p<ppp1pppp1>
114345
Prime: No
Symmetrical: No
Alphabetical: No
Length: 18
Reversals: 5
Max Depth: 5
Factors: 2
Smoothness: 257
Necessary Brackets: 2
<><<<<>>><<<<>>>>>
a<cd>
p1p<ppp1pppp1>
114345
Code: Select all
* ***
* *
* *
* *
*
Prime: No
Symmetrical: No
Alphabetical: No
Length: 18
Reversals: 5
Max Depth: 5
Factors: 2
Smoothness: 257
Necessary Brackets: 2
 Vytron
 Posts: 432
 Joined: Mon Oct 19, 2009 10:11 am UTC
 Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P
Re: Count up with recursive prime factorization
In 3D phlip's notation.
Re: Count up with recursive prime factorization
I don't think you should have put the five in front of the primetwentyseven, because that looks really weird and it makes me think the 3dnotation is claiming that the number is a primebubble when it is really two bubbles in front of each other.
516
<><><<>><<><<><>>> (bnot.)
COLON SUN(OH(COLON)) (AB. bnot.)
(Labyrinthine notation)
516
<><><<>><<><<><>>> (bnot.)
COLON SUN(OH(COLON)) (AB. bnot.)
(Labyrinthine notation)
 Vytron
 Posts: 432
 Joined: Mon Oct 19, 2009 10:11 am UTC
 Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P
Re: Count up with recursive prime factorization
Elmach wrote:it is really two bubbles in front of each other.
That's the idea! This is a sideway representation of the number:
The smaller sphere is not inside the bigger one! The problem with this sideway representation is that it isn't 3D (i.e. those circles could be represented with 2D shapes, whereas tridimensionality is necessary to see the spheres are in front of each other.)
ΛΛΛ
o
VVV
◠
⊙
<<◇>>
◡
o
VVV
◠
⊙
<<◇>>
◡
517
Re: Count up with recursive prime factorization
518
<><:><:<<>>> (colonned bnotation)
(boundary labyrinthine notation)
(level set lab. not)
(compacter blab. not.)
(that one in lslab. not.)
I think that is the most compact (EDIT: perimeterwise) you can get in labyrinthine notation. (Clearly every lslab.not. gives rise to a blab.not. of the same structure, so it doesn't matter if you use one or the other; although blab is larger, I think lslab is more readable.)
EDIT:No; clearly, rotating the left p12 will result in less space used, minimizing area. This would be true if it were half the size. This is false.
Clearly, it has to be at least five(lslab)/eleven (blab)tall to hold the <<<>>> bit.
<><:><:<<>>> (colonned bnotation)
(boundary labyrinthine notation)
(level set lab. not)
(compacter blab. not.)
(that one in lslab. not.)
I think that is the most compact (EDIT: perimeterwise) you can get in labyrinthine notation. (Clearly every lslab.not. gives rise to a blab.not. of the same structure, so it doesn't matter if you use one or the other; although blab is larger, I think lslab is more readable.)
EDIT:
Clearly, it has to be at least five(lslab)/eleven (blab)tall to hold the <<<>>> bit.
 Vytron
 Posts: 432
 Joined: Mon Oct 19, 2009 10:11 am UTC
 Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P
Re: Count up with recursive prime factorization
That gives me an idea for a notation, will use it first time I have the chance.
519
<〇>
Λ
〇〇〇
<<〇>>
V
Λ
〇〇〇
<<〇>>
V
519
Re: Count up with recursive prime factorization
Alright! Can't wait to see it.
520:
<><<<>>><><<><<>>> (bnotation)
Asymmetric, analphabetic, composite, <<><<>>>smooth, which is quite smooth, actually!
If this were 260, then it would be nice. But it isn't, so it has this sort of boundarylabyrinthinenotation. (In levelset labyrinthine, it is , of course.)
Something about labynot. makes fives () much larger than sevens (). Odd. (It's because going deeper is more expensive than making another. For small numbers.)
520:
<><<<>>><><<><<>>> (bnotation)
Asymmetric, analphabetic, composite, <<><<>>>smooth, which is quite smooth, actually!
If this were 260, then it would be nice. But it isn't, so it has this sort of boundarylabyrinthinenotation. (In levelset labyrinthine, it is , of course.)
Something about labynot. makes fives () much larger than sevens (). Odd. (It's because going deeper is more expensive than making another. For small numbers.)
Last edited by Elmach on Sat Nov 29, 2014 7:14 am UTC, edited 2 times in total.
 Vytron
 Posts: 432
 Joined: Mon Oct 19, 2009 10:11 am UTC
 Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P
Re: Count up with recursive prime factorization
Oh well, doesn't look at all how I imagined it.
The idea is to make a cubelike visualization of a Labyrinth representation, by having a maze in each face. Perhaps with a more complex design...
Re: Count up with recursive prime factorization
Alright then, would 523 be a prime that would work better?
522  composite, analphabetic, asymmetric
<><<>><<>><<><<<>>>>  bracket notation
abb<ac>  alphabetic bracket notation
 Labyrinthine notation, levelset mode.
 Labyrinthine notation, boundary mode.
522  composite, analphabetic, asymmetric
<><<>><<>><<><<<>>>>  bracket notation
abb<ac>  alphabetic bracket notation
 Labyrinthine notation, levelset mode.
 Labyrinthine notation, boundary mode.
 Vytron
 Posts: 432
 Joined: Mon Oct 19, 2009 10:11 am UTC
 Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P
Re: Count up with recursive prime factorization
Um... well, at least it looks somewhat more inspired.
Re: Count up with recursive prime factorization
Well... 525 must be better, right? (assuming smooth numbers are good.)
524:
<><<><><><><>><> (bnotation)
SYMMETRIC, but composite, and analphabetic.
Labyrinthine
524:
<><<><><><><>><> (bnotation)
SYMMETRIC, but composite, and analphabetic.
Labyrinthine
Last edited by Elmach on Sat Nov 29, 2014 8:52 am UTC, edited 3 times in total.
 Vytron
 Posts: 432
 Joined: Mon Oct 19, 2009 10:11 am UTC
 Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P
Re: Count up with recursive prime factorization
Still doesn't look like a labyrinth at all D:
Anyway, returning to text on next post...
 phillip1882
 Posts: 145
 Joined: Fri Jun 14, 2013 9:11 pm UTC
 Location: geogia
 Contact:
Re: Count up with recursive prime factorization
<><<><><><<><>>> 526
efficiency: 66.81%
efficiency: 66.81%
good luck have fun
Re: Count up with recursive prime factorization
527
<<<><>>><<<<<>>>>>
<<aa>>e
p<p<p1p1>>ppppp1
311355
Prime: No
Symmetrical: No
Alphabetical: No
Length: 18
Reversals: 5
Max Depth: 5
Factors: 2
Smoothness: 31
Necessary Brackets: 4
<<<><>>><<<<<>>>>>
<<aa>>e
p<p<p1p1>>ppppp1
311355
Code: Select all
*** *
*** *
* * *
*
*
Prime: No
Symmetrical: No
Alphabetical: No
Length: 18
Reversals: 5
Max Depth: 5
Factors: 2
Smoothness: 31
Necessary Brackets: 4
Re: Count up with recursive prime factorization
528
<><><><><<>><<<<>>>> in bnotation
aaaabd in alphabetic bnotation
in levelset labyrinthine notation
in boundary lnotation
alphabetic, asymmetric, and composite. dsmooth.
<><><><><<>><<<<>>>> in bnotation
aaaabd in alphabetic bnotation
in levelset labyrinthine notation
in boundary lnotation
alphabetic, asymmetric, and composite. dsmooth.
 Vytron
 Posts: 432
 Joined: Mon Oct 19, 2009 10:11 am UTC
 Location: The Outside. I use She/He/Her/His/Him as gender neutral pronouns :P
Re: Count up with recursive prime factorization
"<o> <o>"
"<o> <o>"
"<o> <o>"
529
Where I am using quotes as another pair of angle brackets.
Re: Count up with recursive prime factorization
530
<><<<>>><<><><><>>
ac<aaaa>
p1ppp1p<p1p1p1p1>
113321111112
Prime: No
Symmetrical: No
Alphabetical: No
Length: 18
Reversals: 11
Max Depth: 3
Factors: 3
Smoothness: 53
Necessary Brackets: 2
<><<<>>><<><><><>>
ac<aaaa>
p1ppp1p<p1p1p1p1>
113321111112
Code: Select all
* * *******
* * * * *
*
Prime: No
Symmetrical: No
Alphabetical: No
Length: 18
Reversals: 11
Max Depth: 3
Factors: 3
Smoothness: 53
Necessary Brackets: 2