A165466 -id:A165466

Search: a165466 -id:a165466

Displaying 1-3 of 3 results found.

page 1

A165467

Positions of zeros in A165466. Fixed points of A166043/A166044.

+20
6

0, 8, 9, 105, 1126, 6643718, 6643719, 6643727, 6643728, 6643729, 6643735, 6643736, 6643743, 6643744, 6643745, 6643752, 7746856, 7746857, 7746886, 7746887, 7746888, 7746889, 7747606, 7747718, 7747719, 7747720, 7747737 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,2`
	COMMENTS	Here is a little parable for illustrating the magnitudes of the numbers involved. Consider two immortal sage kings traveling on the infinite chessboard, visiting every square at a leisurely pace of one square per day. Both start their journey at the beginning of the year from the upper left-hand corner square at Day 0 (being sages, they can comfortably stay in the same square). One decides to follow the Hilbert curve (as in A163357) on his never-ending journey, while the other follows the Peano curve (as in A163336; both walks are illustrated in entry A166043). This sequence gives the days when they will meet, when they both arrive at the same square on the same day. From the corner, one king walks first towards the east, while the other walks towards the south, so their paths diverge at the beginning. However, about a week later (Day 8), they meet again on square (2,2), two squares south and two squares east of the starting corner. The next day they are both traveling towards the south, so they meet also on Day 9, at square (3,2). After that, they meet briefly three months later (Day 105), and also about three years later (Day 1126), after which they loathe each other so much that they both walk in solitude for the next 18189 (eighteen thousand one hundred and eighty nine) years before they meet again, total of eleven times in just about one month's time (days 6643718-6643752). - Antti Karttunen, Oct 13 2009 [Edited to Hilbert vs Peano by Kevin Ryde, Aug 29 2020]
	LINKS	`A. Karttunen, Table of n, a(n) for n = 0..29`
	CROSSREFS	`Subset of A165480. Cf. also A165465, A163901.`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen, Oct 06 2009`
	STATUS	`approved`

A166045

Positions of records in A165601.

+10
4

0, 2, 8, 14, 29, 32, 62, 74, 104, 152, 164, 182, 224, 242, 272, 419, 422, 434, 452, 554, 662, 734, 812, 1022, 1064, 1154, 1274, 1442, 1742, 1904, 2072, 2132, 2384, 2762, 3002, 3464, 3584, 3884, 4712, 4802, 4844, 5114, 5642, 6272, 6362, 6542, 6692 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,2`
	LINKS	`A. Karttunen, Table of n, a(n) for n = 0..120`
	CROSSREFS	`See A165466 and A166047 for the records themselves.`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen, Oct 06 2009`
	STATUS	`approved`

A165464

Squared distance between n's location in A163334 array and A163357 array.

+10
3

0, 0, 2, 4, 2, 4, 2, 0, 0, 2, 2, 4, 4, 4, 2, 0, 0, 2, 2, 4, 4, 2, 0, 0, 0, 0, 2, 4, 4, 2, 8, 10, 16, 16, 4, 2, 2, 10, 16, 10, 8, 8, 20, 20, 20, 18, 18, 32, 18, 10, 4, 2, 4, 10, 8, 2, 2, 10, 10, 4, 4, 4, 2, 10, 16, 26, 20, 10, 2, 4, 10, 18, 32, 32, 50, 52, 52, 34, 40, 58, 80, 80, 106, 146 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,3`
	COMMENTS	`Equivalently, squared distance between n's location in A163336 array and A163359 array. See example at A166041.`
	LINKS	`A. Karttunen, Table of n, a(n) for n = 0..65535`
	FORMULA	`a(n) = A000290(abs(A163529(n)-A059252(n))) + A000290(abs(A163528(n)-A059253(n))).`
	PROG	`(MIT Scheme:) (define (A165464 n) (+ (A000290 (abs (- (A163529 n) (A059252 n)))) (A000290 (abs (- (A163528 n) (A059253 n))))))`
	CROSSREFS	`Positions of zeros: A165465. See also A165466, A163897, A163900.`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen, Oct 06 2009`
	STATUS	`approved`

page 1

Search completed in 0.008 seconds