A328115 -id:A328115 - cp's OEIS frontend

A327975 Breadth-first reading of the subtree rooted at 5 of the tree where each parent node is the arithmetic derivative (A003415) of all its children.

5, 6, 9, 14, 33, 49, 62, 94, 177, 817, 961, 445, 913, 1633, 2173, 2209, 1146, 886, 1822, 4414, 19193, 25829, 32393, 41033, 47429, 57929, 64133, 88229, 101753, 111173, 116729, 129413, 138233, 148553, 160229, 173093, 183929, 188453, 208613, 216773, 232229, 235913, 244229, 249929, 257573, 262793, 272633, 278153, 282533, 288329, 294473, 304613, 316229, 320933, 322853, 323429, 327653, 328313, 1155, 2649

Offset: 1

Antti Karttunen, Oct 02 2019

Permutation of A328115.
The branching degree of vertex v is given by A099302(v).
Leaves form a subsequence of A098700.
Most terms of A189760 (apart from 0, 1, 2, 414, ...) seem to be located in this tree, in positions where they have no smaller siblings.
For any number k at level n (where 5 is at level 2), we have A256750(k) = A327966(k) = n.
Question: Does this subtree contain infinitely long paths? How many? Cf. conjecture number 8 in Ufnarovski and Ahlander paper, and a similar tree starting from 7, A327977.

			Because we have A003415(5) = 1, A003415(6) = 5, A003415(9) = 6, A003415(14) = 9, A003415(33) = A003415(49) = 14, A003415(62) = 33, etc, this subtree is laid out as below. The terms of this sequence are obtained by scanning each successive level of the tree from left to right, from the node 5 onward:
   (0)
    |
   (1)
    |
    5
    |
    6
    |
    9
    |
    14________________
    |                 |
    33               49
    |                 |
    62________       94_____________________________
    |    |    |       |       |      |      |       |
    |    |    |       |       |      |      |       |
   177  817  961     445     913   1633   2173    2209
              |       |       |                     |
              |       |       |                     |
            1146     886    1822                  4414
              |       |       |                     |
              |       |       |                     |
            (19193,  (1155,  (19921, ..., 829921)  (22045, ..., 4870849)
             25829,   2649,                        [49 children for 4414]
               ...,  ...,    [27 children for 1822]
            328313)  196249)
                     [19 children for 886]
        [38 children
         for 1146]
The row lengths thus start as: 1, 1, 1, 1, 2, 2, 8, 4, 133 (= 38+19+27+49), ...

Victor Ufnarovski and Bo Ahlander, How to Differentiate a Number, J. Integer Seqs., Vol. 6, 2003.

Cf. A003415, A098699, A098700, A099302, A099303, A099307, A099308, A189760, A256750, A327966, A327968, A328115.

Cf. A327977 for the subtree starting from 7, and also A263267 for another similar tree.

A002620(n) = ((n^2)>>2);
A003415(n) = {my(fac); if(n<1, 0, fac=factor(n); sum(i=1, matsize(fac)[1], n*fac[i, 2]/fac[i, 1]))}; \\ From A003415
A327975list(e) = { my(lista=List([5]), f); for(n=1, e, f = lista[n]; for(k=1,1+A002620(f),if(A003415(k)==f, listput(lista,k)))); Vec(lista); };
v328975 = A327975list(21);
A327975(n) = v328975[n];

# uses[A003415]
def A327975():
  '''Breadth-first reading of irregular subtree rooted at 5, defined by the edge-relation A003415(child) = parent.'''
  yield 5
  for x in A327975():
    for k in [1 .. 1+(x*x)//2]:
      if A003415(k) == x: yield k
def take(n, g):
  '''Returns a list composed of the next n elements returned by generator g.'''
  z = []
  if 0 == n: return z
  for x in g:
    z.append(x)
    if n > 1: n = n-1
    else: return(z)
take(60, A327975())

A351078 First noncomposite number reached when iterating the map x -> x', when starting from x = n, or 0 if no such number is ever reached. Here x' is the arithmetic derivative of x, A003415.

Original entry on oeis.org

0, 1, 2, 3, 0, 5, 5, 7, 0, 5, 7, 11, 0, 13, 5, 0, 0, 17, 7, 19, 0, 7, 13, 23, 0, 7, 0, 0, 0, 29, 31, 31, 0, 5, 19, 0, 0, 37, 7, 0, 0, 41, 41, 43, 0, 0, 7, 47, 0, 5, 0, 0, 0, 53, 0, 0, 0, 13, 31, 59, 0, 61, 5, 0, 0, 7, 61, 67, 0, 0, 59, 71, 0, 73, 0, 0, 0, 7, 71, 79, 0, 0, 43, 83, 0, 13, 0, 0, 0, 89, 0, 0, 0, 19, 5

Offset: 0

Antti Karttunen, Feb 11 2022

Primes of A189483 occur only once, on the corresponding indices, while A189441 may also occur in other positions.

There are interesting white "filament-like regions" in the scatter plot.

			For n = 15, if we iterate with A003415, we get a path 15 -> 8 -> 12 -> 16 -> 32 -> 80 -> 176 -> 368 -> ..., where the terms just keep on growing without ever reaching a prime or 1, therefore a(15) = 0.
For n = 18, its path down to zero, when iterating A003415 is: 18 -> 21 -> 10 -> 7 -> 1 -> 0, and the first noncomposite term on the path is prime 7, therefore a(18) = 7.

Antti Karttunen, Table of n, a(n) for n = 0..65537

Cf. A003415, A189441, A189483, A351079, A351259 [= a(A351255(n))].
Cf. A099309 (positions of zeros after the initial one at a(0)=0), A328115 (positions of 5's), A328117 (positions of 7's).
Cf. also A327968.

A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
A351078(n) = { while(n>1&&!isprime(n), n = A003415checked(n)); (n); };

For all n, a(4*n) = a(27*n) = a((p^p)*n) = a(A099309(n)) = 0.

a(p) = p for all primes p.

A328117 Numbers such that zero or more applications of A003415 (arithmetic derivative) will yield 7.

Original entry on oeis.org

7, 10, 18, 21, 25, 38, 46, 65, 77, 98, 129, 170, 205, 217, 254, 361, 414, 426, 462, 493, 501, 529, 718, 753, 982, 998, 1141, 1362, 1501, 1502, 2041, 2045, 2077, 2105, 2257, 2285, 2869, 2933, 2998, 3102, 3133, 3706, 4066, 4078, 4309, 4497, 4885, 5213, 5214, 5461, 5837, 6363, 6410, 6546, 6649, 6749, 6901, 6913, 6937, 6953, 7011

Offset: 1

Antti Karttunen, Oct 06 2019

nonn

Union of {7} with those terms of k of A099308 for which A327968(k) = 7.

			a(4) = 21 is included as A003415(A003415(21)) = 7.
a(627664) = 4294966334 (= 2^32 - 962) is included as A003415^(14)(4294966334) = 7. Note that A327966(4294966334) = 16.

Antti Karttunen, Table of n, a(n) for n = 1..10000
Antti Karttunen, Terms computed up to a(627664) = 4294966334; (all terms in range 1 .. 2^32)

Cf. A003415, A099308, A327966, A327968, A327977, A328115.

A003415checked(n) = if(n<=1, 0, my(f=factor(n), s=0); for(i=1, #f~, if(f[i,2]>=f[i,1],return(0), s += f[i, 2]/f[i, 1])); (n*s));
isA328117(n) = { while((n>7), n = A003415checked(n)); (7==n); };

cp's OEIS Frontend

A327975 Breadth-first reading of the subtree rooted at 5 of the tree where each parent node is the arithmetic derivative (A003415) of all its children.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Sage

A351078 First noncomposite number reached when iterating the map x -> x', when starting from x = n, or 0 if no such number is ever reached. Here x' is the arithmetic derivative of x, A003415.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A328117 Numbers such that zero or more applications of A003415 (arithmetic derivative) will yield 7.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI