cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A325662 Matula-Goebel numbers of regular rooted stars.

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 9, 11, 16, 25, 27, 31, 32, 64, 81, 121, 125, 127, 128, 243, 256, 512, 625, 709, 729, 961, 1024, 1331, 2048, 2187, 3125, 4096, 5381, 6561, 8192, 14641, 15625, 16129, 16384, 19683, 29791, 32768, 52711, 59049, 65536, 78125, 131072, 161051
Offset: 1

Views

Author

Gus Wiseman, May 13 2019

Keywords

Comments

Powers of members of A007097.
A regular rooted star is a rooted tree whose branches are all rooted paths of equal length.
The number of terms <= 10^k, k=0,1,2,...: 1, 7, 15, 26, 35, 46, 56, 67, 76, 87, 98, 109, 121, 131, 142, 154, 163, 175, 185, 198, 208, 220, 231, 241, 254, 265, 275, etc. - Robert G. Wilson v, May 13 2019

Examples

			The sequence of regular rooted stars together with their Matula-Goebel numbers begins:
    1: o
    2: (o)
    3: ((o))
    4: (oo)
    5: (((o)))
    8: (ooo)
    9: ((o)(o))
   11: ((((o))))
   16: (oooo)
   25: (((o))((o)))
   27: ((o)(o)(o))
   31: (((((o)))))
   32: (ooooo)
   64: (oooooo)
   81: ((o)(o)(o)(o))
  121: ((((o)))(((o))))
  125: (((o))((o))((o)))
  127: ((((((o))))))
  128: (ooooooo)
		

Crossrefs

Programs

  • Mathematica
    rpQ[n_]:=n==1||PrimeQ[n]&&rpQ[PrimePi[n]];
    Select[Range[100],#==1||PrimePowerQ[#]&&rpQ[FactorInteger[#][[1,1]]]&]
    (* generates terms <= A007097(max) *) seq[max_] := Module[{ps = NestList[Prime@# &, 1, max], psmax, s = {1}, emax, s1}, pmax = Max[ps]; Do[p = ps[[k]]; emax = Floor[Log[p, pmax]]; s1 = p^Range[emax]; s = Union[s, s1], {k, 2, Length[ps]}]; s]; seq[10] (* Amiram Eldar, Jul 26 2024 *)

Formula

Sum_{n>=1} 1/a(n) = 1 + Product_{k>=1} 1/(A007097(k)-1) = 2.8928887669834086909... - Amiram Eldar, Jul 26 2024

A352288 Total cophenetic index of the rooted tree with Matula-Goebel number n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 2, 0, 3, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 2, 1, 0, 3, 3, 1, 0, 2, 1, 4, 0, 0, 1, 1, 0, 2, 0, 2, 1, 6, 0, 0, 1, 3, 1, 3, 0, 3, 0, 1, 0, 1, 0, 6, 2, 1, 1, 3, 0, 4, 3, 0, 3, 1, 1, 1, 0, 0, 2, 2, 1, 2, 4, 1
Offset: 1

Views

Author

Kevin Ryde, Mar 16 2022

Keywords

Comments

Mir, Rosselló, and Rotger, define the cophenetic value of a pair of childless vertices as the depth (distance down from the root) of their deepest common ancestor, and they then define the total cophenetic index of a tree as the sum of the cophenetic values over all such pairs.
a(n) = 0 iff n is in A325663, being rooted stars with any arm lengths, since the root (depth 0) is the common ancestor of every childless pair.
An identity relating the childless terminal Wiener index TW(n) = A348959(n) can be constructed by noting it measures distances from a pair of childless vertices to their common ancestor, and the cophenetic values measure from that ancestor up to the root. So 2*a(n) + TW(n) is total depths Ext(n) = A196048(n) of the childless vertices, repeated by childless vertices C(n) = A109129(n) except itself, so that 2*a(n) + TW(n) = Ext(n)*(C(n) - 1)

Examples

			For n=111, the tree and its childless pairs and deepest common ancestors are
  root  R         pair  ancestor depth
       / \         G,D     A       1
      A   B        G,E     A       1
     /|\   \       D,E     A       1
    C D E   F     any,F    R       0
    |                             ---
    G                 total a(n) = 3
		

Crossrefs

Cf. A348959 (terminal Wiener), A196048 (external length), A109129 (childless vertices).
Cf. A325663 (indices of 0's), A352289 (max by leaves).

Programs

  • PARI
    \\ See links.

Formula

a(n) = Sum_{i=1..k} a(primepi(p[i])) + binomial(C(p[i]),2), where n = p[1]*...*p[k] is the prime factorization of n with multiplicity (A027746), and C(n) = A109129(n) is the number of childless vertices.
Showing 1-2 of 2 results.