The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A262909

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

A262909

a(n) = greatest k such that A155043(k+A262509(n)) < A155043(A262509(n)).
(history; published version)

#12 by N. J. A. Sloane at Sat Oct 24 12:21:23 EDT 2015

STATUS

proposed

approved

#11 by Antti Karttunen at Mon Oct 12 13:56:02 EDT 2015

STATUS

editing

proposed

#10 by Antti Karttunen at Mon Oct 12 13:36:09 EDT 2015

NAME

a(n) = largest greatest k such that A155043(k+A262509(n)) < A155043(A262509(n)).

#9 by Antti Karttunen at Sun Oct 11 13:01:57 EDT 2015

FORMULA

a(n) = A263081(n) - A262509(n).

#8 by Antti Karttunen at Sun Oct 11 12:58:50 EDT 2015

DATA

5197, 5193, 5177, 5115, 5113, 4419, 4417, 4259, 4245, 4243, 4239, 4059, 4047, 3991, 3941, 3633, 3593, 3449, 3445, 3437, 3423, 3421, 2897, 2789, 2517, 2261, 2079, 2077, 2067, 2063, 1527, 1379, 1135, 1127, 1117, 1103, 1083, 575, 23457, 23451, 21689, 21671, 20241, 19003, 18977, 18649, 18063, 18019, 14853, 14159, 13659, 12707, 11681, 10993, 10991, 10297, 10281, 9151, 9149, 9145, 9111, 8897, 8535, 8147, 6835, 6813, 5539, 5537

Discussion

Sun Oct 11

13:00

Antti Karttunen: For the record: computed as explained in the Sun Oct 6 2015 PinkBox-comments of https://oeis.org/draft/A263081 with an additional definition:

13:00

Antti Karttunen: A262909 = n -> A263081(n) - A262509(n);

13:01

Antti Karttunen: And after running all the prerequisite stuff (as explained in A263081), we have a loop: for(n=1, 68, print1(A262909(n),", "));

#7 by Antti Karttunen at Fri Oct 09 07:31:15 EDT 2015

CROSSREFS

Cf. A000005, A049820, A045765, A262508, A262509, A262908, A263078, A263081.

#6 by Antti Karttunen at Fri Oct 09 07:27:49 EDT 2015

COMMENTS

For all terms a(n) > 0, a(n)+A262509(n) = A263081(n) is by necessity one of the leaves (A045765) in the tree generated by edge-relation A049820(child) = parent. See also comments in A262908.

CROSSREFS

Cf. A000005, A049820, A045765, A262908, A263078, A263081.

#5 by Antti Karttunen at Fri Oct 09 06:59:58 EDT 2015

FORMULA

a(n) = A263078(A262509(n)).

CROSSREFS

Cf. A000005, A049820, A045765, A262908, A263078.

#4 by Antti Karttunen at Fri Oct 09 05:28:00 EDT 2015

COMMENTS

There might occur also negative terms, but no zeros.

For all nonzero terms a(n), > 0, a(n)+A262509(n) is by necessity one of the leaves (A045765) in the tree generated by edge-relation A049820(child) = parent. See also comments in A262908.

#3 by Antti Karttunen at Fri Oct 09 05:18:36 EDT 2015

DATA

COMMENTS

For all nonzero terms a(n), a(n)+A262509(n) is by necessity one of the leaves (A045765) in the tree generated by edge-relation A049820(child) = parent. See also comments in A262908.

CROSSREFS

Cf. A000005, A049820, A045765, A262908.