Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081883
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081883 Numbers n such that the number of steps needed to reach an integer starting with n-1/4 or n+1/4 and iterating the map x-->x*ceiling(x) is the same. +0
1
5, 9, 21, 37, 46, 49, 53, 69, 85, 101, 113, 117, 121, 133, 137, 149, 165, 174, 177, 181, 197, 213, 217, 229, 241, 245, 261, 265, 277, 293, 302, 305, 309, 313, 325, 341, 357, 369, 373, 389, 393, 405, 421, 430, 433, 437, 441, 453, 469, 485, 497, 501, 517, 521 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A068119.

Sequence in context: A068481 A146827 A147018 this_sequence A049744 A000323 A146131

Adjacent sequences: A081880 A081881 A081882 this_sequence A081884 A081885 A081886

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 13 2003

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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research