|
%I #27 Mar 27 2017 03:42:04
%S 2,9,14,21,25,33,34,38,57,85,86,93,94,116,118,121,122,133,141,142,145,
%T 158,170,171,177,201,202,205,213,214,217,218,253,284,298,301,302,326,
%U 332,334,361,369,381,387,393,394,434,435,445,446,453,481,501,514,526
%N A term in this sequence a(n) is such that n and n+1 have isomorphic factor decomposition binary trees.
%C Integral Fission (consecutive isomorphic trees): For a natural number, n, make it the root node of a binary tree. The left child node (L) is the largest divisor of n which is greater than 1 but less than or equal to the square root of n, if this exists. The right child node is n/L, if the left node exists. Thus if n is a prime it is a leaf node; otherwise if it is composite then it is the product of its two children. If n = 1 then we have an empty tree.
%H Alois P. Heinz, <a href="/A242466/b242466.txt">Table of n, a(n) for n = 1..10000</a>
%H Gordon Hamilton, <a href="http://youtu.be/1fpY8WU_DJI">Integral Fission</a>, Video for grade 7 teachers
%p with(numtheory):
%p t:= proc(n) option remember; `if`(n=1, "0",
%p `if`(isprime(n), "10", (d-> cat("1", t(d), t(n/d), "0"))(
%p max(select(x-> is(x<=sqrt(n)), divisors(n))[]))))
%p end:
%p a:= proc(n) option remember; local k;
%p for k from 1 +`if`(n=1, 0, a(n-1))
%p while t(k)<>t(k+1) do od; k
%p end:
%p seq(a(n), n=1..60); # _Alois P. Heinz_, Aug 09 2014
%t t[n_] := t[n] = If[n == 1, "0", If[PrimeQ[n], "10", ("1" <> t[#] <> t[n/#] <> "0"&)[Max[Select[Divisors[n], # <= Sqrt[n]&]]]]];
%t a[n_] := a[n] = (For[k = 1 + If[n == 1, 0, a[n-1]], t[k] != t[k+1], k++]; k);
%t Array[a, 60] (* _Jean-François Alcover_, Mar 27 2017, after _Alois P. Heinz_ *)
%o (PARI) isok(n) = eqvec(empty(fiss(n)), empty(fiss(n+1))); \\ using A125508 scripts; _Michel Marcus_, May 25 2014
%Y Cf. A125508.
%K nonn
%O 1,1
%A _Gordon Hamilton_, May 15 2014
%E More terms from _Michel Marcus_, May 25 2014
|
