[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

Showing entries 1-10 | older changes
Central diagonal of array A129595.
(history; published version)
#18 by N. J. A. Sloane at Sat Oct 23 00:32:11 EDT 2021
STATUS

proposed

approved

#17 by Antti Karttunen at Sat Oct 16 15:43:15 EDT 2021
STATUS

editing

proposed

#16 by Antti Karttunen at Sat Oct 16 15:42:32 EDT 2021
LINKS

Antti Karttunen, <a href="/A129597/b129597.txt">Table of n, a(n) for n = 1..10000</a>

PROG

(PARI) A129597(n) = if(1==n, n, my(f=factor(n)); (2*n*n)/f[#f~, 1]); \\ Antti Karttunen, Oct 16 2021

#15 by Gus Wiseman at Sat Oct 16 15:18:00 EDT 2021
COMMENTS

These are the positions of first appearances of each positive integer in A329888, and also in A346704. - Gus Wiseman, Aug 10 Oct 16 2021

STATUS

approved

editing

Discussion
Sat Oct 16
15:35
Antti Karttunen: Yes, looks good. Please wait a bit, I will compute a b-file for this one.
#14 by Joerg Arndt at Tue Sep 07 02:29:37 EDT 2021
STATUS

reviewed

approved

#13 by Sean A. Irvine at Mon Sep 06 16:55:38 EDT 2021
STATUS

proposed

reviewed

#12 by Gus Wiseman at Fri Aug 20 01:28:07 EDT 2021
STATUS

editing

proposed

Discussion
Mon Sep 06
16:54
Sean A. Irvine: A345957 is approved.
#11 by Gus Wiseman at Fri Aug 20 01:28:01 EDT 2021
CROSSREFS

A001222 counts prime factors with multiplicity.

Cf. A000290, A006530, A037143, `A112798, A344606, `A344653, A345957, A346697, A346700, A346701.

#10 by Gus Wiseman at Fri Aug 20 01:25:31 EDT 2021
FORMULA

If g = A006530(n > 1) is the greatest prime factor of n, > 1, then a(n) = 2n^2/g = 2*A342768(n).

CROSSREFS

The sum of prime indices of a(n > 1) is 2*A056239(n) - A061395(n) + 1 for n > 1.

The odd version for odd indices is A342768(n) = a(n)/2 for n > 1.

A056239 A346633 adds up prime indices, row sums the even bisection of A112798standard compositions (odd: A209281).

A209281 (shifted) A346698 adds up the odd even bisection of standard compositionsprime indices (reverse: A346699).

A316524 gives the alternating sum of prime indices (reverse: A344616).

A346633 adds up the even bisection of standard compositions.

A346697 adds up the odd bisection of prime indices (reverse: A346699).

Cf. A000290, A000720, A006530, A037143, A341446, `A112798, A344606, A344617, `A344653, *A345957, `A345960, A346698, A346697, A346700, `A346701.

#9 by Gus Wiseman at Fri Aug 13 03:56:03 EDT 2021
CROSSREFS

These are the positions of first appearances in A346704, and also in A329888.

A027193 counts partitions of odd length, ranked by A026424.

A103919 counts partitions by sum and alternating sum (reverse: A344612).

A344606 counts alternating permutations of prime indices.

A344617 gives the sign of the alternating sum of prime indices.

A346697 gives the sum of adds up the odd bisection of prime indices (reverse: A346699).

A346699 gives the sum of the odd bisection of reversed prime indices.

Cf. A000290, A000720, A006530, A033942, A037143, A341446, A344606, A344617, `A344653, *A345957, A345958, A345959, `A345960, A346635, A346698, A346700, `A346701, A346704.

Discussion
Wed Aug 18
17:38
Gus Wiseman: waiting for A345957