Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A298536

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Matula-Goebel numbers of rooted trees such that every branch of the root has a different number of leaves.
(history; published version)
#6 by Bruno Berselli at Mon Jan 22 03:07:40 EST 2018
STATUS

reviewed

approved

#5 by Joerg Arndt at Sun Jan 21 02:31:38 EST 2018
STATUS

proposed

reviewed

#4 by Gus Wiseman at Sat Jan 20 22:09:33 EST 2018
STATUS

editing

proposed

#3 by Gus Wiseman at Sat Jan 20 22:08:17 EST 2018
#2 by Gus Wiseman at Sat Jan 20 21:37:19 EST 2018
NAME

allocated for Gus WisemanMatula-Goebel numbers of rooted trees such that every branch of the root has a different number of leaves.

DATA

1, 2, 3, 5, 7, 11, 13, 14, 17, 19, 21, 23, 26, 29, 31, 34, 35, 37, 38, 39, 41, 43, 46, 47, 51, 53, 57, 58, 59, 61, 65, 67, 69, 71, 73, 74, 77, 79, 82, 83, 85, 86, 87, 89, 94, 95, 97, 101, 103, 106, 107, 109, 111, 113, 115, 118, 122, 123, 127, 129, 131, 133

OFFSET

1,2

EXAMPLE

Sequence of trees begins:

1 o

2 (o)

3 ((o))

5 (((o)))

7 ((oo))

11 ((((o))))

13 ((o(o)))

14 (o(oo))

17 (((oo)))

19 ((ooo))

21 ((o)(oo))

23 (((o)(o)))

26 (o(o(o)))

29 ((o((o))))

31 (((((o)))))

34 (o((oo)))

35 (((o))(oo))

37 ((oo(o)))

38 (o(ooo))

39 ((o)(o(o)))

41 (((o(o))))

43 ((o(oo)))

46 (o((o)(o)))

47 (((o)((o))))

MATHEMATICA

nn=2000;

primeMS[n_]:=If[n===1, {}, Flatten[Cases[FactorInteger[n], {p_, k_}:>Table[PrimePi[p], {k}]]]];

leafcount[n_]:=If[n===1, 1, With[{m=primeMS[n]}, If[Length[m]===1, leafcount[First[m]], Total[leafcount/@m]]]];

Select[Range[nn], UnsameQ@@leafcount/@primeMS[#]&]

KEYWORD

allocated

nonn

AUTHOR

Gus Wiseman, Jan 20 2018

STATUS

approved

editing

#1 by Gus Wiseman at Sat Jan 20 21:37:19 EST 2018
NAME

allocated for Gus Wiseman

KEYWORD

allocated

STATUS

approved