Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A160267
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A160267 a(n)=min(A122458(n),A160266(n)), n>=1 +0
5
2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1 (list; graph; listen)
OFFSET

1,1

COMMENT

Let f be defined as in A159885. Then a(n) is the least k such that either f^k(2n+1))<2n+1 or A006694((f^k(2n+1)-1)/2)<A006694(n).

CROSSREFS

A006694 A122458 A160266 A159885 A159945 A160198

Sequence in context: A111946 A137844 A079229 this_sequence A115621 A077565 A115561

Adjacent sequences: A160264 A160265 A160266 this_sequence A160268 A160269 A160270

KEYWORD

nonn,uned

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), May 07 2009, May 11 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research