cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A334225 The values n where A334148(n) = n.

Original entry on oeis.org

3, 4, 5, 23, 140, 290
Offset: 0

Views

Author

Scott R. Shannon, Apr 19 2020

Keywords

Comments

See A334148 for the definition of the sequence and a plot of other n values.
There are no other values for n up to 1000000. As A334148(n) increase slowly for n, for example A334148(1000000) = 6655, it is almost certain that no other values exist.

Examples

			3 is a term as starting from 3 the sequence of visited numbers is 3,2,0,3 and 3 is the first term to repeat.
23 is a term as starting from 23 the sequence of visited numbers is 23,22,20,17,13,8,2,9,1,10,0,11,23 and 23 is the first term to repeat.
290 is a term as starting from 290 the sequence of visited numbers is 290,289,287,284,280,275,269,262,254,245,235,224,212,199,185,170,154,137,119,100,80,59,37,14,38,13,39,12,40,11,41,10,42,9,43,8,44,7,45,6,46,5,47,4,48,3,49,2,50,1,51,0,52,105,159,104,160,103,161,102,162,101,163,226,290 and 290 is the first term to repeat. This is almost certainly the largest such value.
		

Crossrefs