[go: up one dir, main page]

login
Revision History for A253630 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of iterations of A253629 needed for n to reach 2.
(history; published version)
#12 by Bruno Berselli at Tue Mar 10 18:59:08 EDT 2015
STATUS

editing

approved

#11 by Bruno Berselli at Tue Mar 10 18:58:56 EDT 2015
COMMENTS

If x or y is odd, then a(xy) = a(x) + a(y).

If x and y are both even, then a(xy) = a(x) + a(y) + 1.

Equivalently, if we define a function D by D(x) = a(x) if x is odd and D(x) = a(x) + 1 if x is even, then D is completely additive.

MATHEMATICA

L[n_] := If[EvenQ[n], (1/3) If[n > 1, n Times @@ (1 + 1/(Select[Divisors[n], PrimeQ])), 1], If[n > 1, n Times @@ (1 + 1/(Select[Divisors[n], PrimeQ])), 1]]; Table[Length@NestWhileList[L, n, # != 1 &] - 2, {n, 2, 260}]

EvenQ[n], (1/3) If[n > 1,

n*Times @@ (1 + 1/(Select[Divisors[n], PrimeQ])), 1],

If[n > 1, n*Times @@ (1 + 1/(Select[Divisors[n], PrimeQ])), 1]]

Table[Length@NestWhileList[L, n, # != 1 &]-2, {n, 2, 260}]

STATUS

reviewed

editing

#10 by Michel Marcus at Tue Mar 10 17:00:10 EDT 2015
STATUS

proposed

reviewed

#9 by Michel Marcus at Mon Feb 23 03:54:30 EST 2015
STATUS

editing

proposed

Discussion
Tue Mar 10
17:00
Michel Marcus: well ....
#8 by Michel Marcus at Mon Feb 23 03:53:15 EST 2015
COMMENTS

If x or y is odd, then a(xy)=a(x)+a(y).

If x and y are both even, then a(xy)=a(x)+a(y)+1.

If x or y is odd, then a(xy)=a(x)+a(y). If x and y are both even, then a(xy)=a(x)+a(y)+1. Equivalently, if we define a function D by D(x)=a(x) if x is odd and D(x)=a(x)+1 if x is even, then D is completely additive.

STATUS

proposed

editing

Discussion
Mon Feb 23
03:54
Michel Marcus: comments better like this ?
#7 by Michel Marcus at Wed Jan 21 09:07:38 EST 2015
STATUS

editing

proposed

Discussion
Wed Jan 21
09:23
Michel Marcus: Colin, did you try this ?
a(n) = smallest k having such that A253630(k) = n
got 2, 4, 3, 5, 9, 15, 25, 45, 75, 125, ...
similar to A005517 ...
#6 by Michel Marcus at Wed Jan 21 09:06:34 EST 2015
PROG

(PARI) a253629(n) = my(f=factor(n)); prod(i=1, #f~, f[i, 1]^(f[i, 2]-1)*if(f[i, 1]>2, f[i, 1]+1, 1)) ;

a(n) = my(nb = 0); my(m = n); while(m != 2, m = a253629(m); nb++); nb; \\ Michel Marcus, Jan 21 2015

CROSSREFS

Cf. A253629.

STATUS

proposed

editing

#5 by Michel Marcus at Tue Jan 06 23:28:44 EST 2015
STATUS

editing

proposed

#4 by Michel Marcus at Tue Jan 06 23:28:33 EST 2015
DATA

0, 2, 1, 3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 6, 4, 6, 4, 6, 5, 5, 4, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 7, 5, 6, 5, 6, 6, 7, 5, 7, 6, 7, 5, 7, 6, 7, 6, 6, 5, 7, 5, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 8, 6, 7, 6, 7, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 7, 7, 6, 7, 6, 8, 6, 7, 6, 8, 7, 8, 7, 7, 6, 8, 7, 8, 7, 8, 7, 8, 6, 8, 7, 8, 7, 8, 7, 8, 7, 8, 6, 8, 6, 9, 7, 7, 6, 8, 7, 8, 7, 8, 7, 9, 7, 8, 7, 8, 7, 8, 7, 8, 7, 9, 7, 8, 7, 9, 8, 8, 7, 9, 7, 8, 7, 8, 7, 9, 7, 8, 8, 8, 7, 9, 7, 8, 7, 8, 8, 9, 7, 9, 8, 9, 7, 9, 8, 9, 8, 8, 7, 8, 7, 9, 7, 9, 7, 9, 8, 8, 7, 8, 7, 9, 7, 9, 8, 9, 8, 9, 8, 9, 8, 9, 7, 9, 7, 9, 8, 9, 8, 9, 8, 9, 8, 8, 8, 9, 8, 9, 8, 8, 7, 10, 8, 9, 8, 9, 8, 9, 8, 9, 8, 9, 8, 9, 8, 9, 8, 9, 8, 10, 7, 9, 8, 9, 7, 9, 9, 9, 8, 9, 7, 10, 7, 9, 8, 9, 8

LINKS

Colin Defant, <a href="http://arxiv.org/abs/1501.00971">An arithmetic function arising from the Dedekind $\psi$ function</a>, arXiv:1501.00971 [math.NT], 2015.

STATUS

proposed

editing

Discussion
Tue Jan 06
23:28
Michel Marcus: Edit screen says : Entries usually give at most 260 characters
#3 by Colin Defant at Tue Jan 06 21:18:13 EST 2015
STATUS

editing

proposed