The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A304028

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A304028

Numbers k such that A033461(k) is divisible by k.
(history; published version)

#15 by Joerg Arndt at Sat May 05 06:38:53 EDT 2018

STATUS

reviewed

approved

#14 by Vaclav Kotesovec at Sat May 05 04:11:57 EDT 2018

STATUS

proposed

reviewed

#13 by Altug Alkan at Fri May 04 20:27:57 EDT 2018

STATUS

editing

proposed

#12 by Altug Alkan at Fri May 04 20:22:48 EDT 2018

COMMENTS

This is different from A001422 is a finite subsequence.

STATUS

proposed

editing

Discussion

Fri May 04

20:27

Altug Alkan: Maybe it is a little bit obvious that "This is different from A001422." So I changed it like that in order to be more effective. For me difference set from it would be more interesting sequence. I don't know it is in OEIS or not. Best regards.

#11 by Jon E. Schoenfield at Fri May 04 20:17:18 EDT 2018

STATUS

editing

proposed

#10 by Jon E. Schoenfield at Fri May 04 20:17:14 EDT 2018

EXAMPLE

2229 is in the sequence because A033461(2229) = 51267 = 23 * 2229.

STATUS

proposed

editing

#9 by Vaclav Kotesovec at Fri May 04 18:54:24 EDT 2018

STATUS

editing

proposed

#8 by Vaclav Kotesovec at Fri May 04 18:53:39 EDT 2018

NAME

Numbers k such that k divides A033461(k) is divisible by k.

#7 by Vaclav Kotesovec at Fri May 04 18:40:50 EDT 2018

CROSSREFS

Cf. A001422, A033461, A051177, A056848, A276517.

#6 by Vaclav Kotesovec at Fri May 04 18:36:20 EDT 2018

MATHEMATICA

max = 100; p = ConstantArray[0, max^2 + 1]; p[[1]] = 1; p[[2]] = 1; Do[Do[p[[j + 1]] += p[[j - k^2 + 1]], {j, max^2, k^2, -1}]; , {k, 2, max}]; Select[Range[1, max^2], ModDivisible[p[[# + 1]], #] == 0 &]