login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159629 Slowest increasing sequence beginning with a(1)=4 such that A002828(a(n))=A002828(n). 5
4, 5, 6, 9, 10, 11, 15, 17, 25, 26, 27, 30, 32, 33, 39, 49, 50, 52, 54, 58, 59, 62, 63, 66, 81, 82, 83, 87, 89, 91, 92, 97, 99, 101, 102, 121, 122, 123, 124, 125, 128, 129, 131, 132, 136, 138, 143, 147, 169, 170, 171, 173, 178, 179, 183, 184, 186, 193, 195, 199, 200, 201, 207 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Conjecture: For every m>2 there exists a minimum index N(m) such that the minimal increasing recursive sequence S_m(n)

beginning with m^2 with the condition A002828(S_m(n))= A002828(n) coincides with a(n) for all n>N.

LINKS

V. Shevelev, Several results on sequences which are similar to the positive integers arXiv:0904.2101

FORMULA

a(n+1)=min{l>a(n) : A002828(l)=A002828(n+1)}.

CROSSREFS

Cf. A002828, A159619, A159615, A007814, A004760, A159559, A159560

Sequence in context: A114454 A008854 A062726 * A082812 A075903 A029942

Adjacent sequences:  A159626 A159627 A159628 * A159630 A159631 A159632

KEYWORD

nonn

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), Apr 17 2009, May 04 2009

EXTENSIONS

137 replaced by 136, Extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 17 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 14:57 EST 2012. Contains 205823 sequences.