Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A035280
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A035280 Smallest of largest of n distinct numbers around circle so that every 2 neighbors x,y have x|y or y|x. +0
1
1, 2, 4, 6, 6, 8, 9, 12, 12, 12, 15, 15, 16, 18, 18, 20, 21, 24, 24, 24, 27, 28, 30, 30, 32, 33, 35, 36 (list; graph; listen)
OFFSET

1,2

LINKS

E. J. Friedman, Math. Magic

CROSSREFS

Cf. A034298.

Sequence in context: A090346 A092989 A065558 this_sequence A020887 A050827 A082990

Adjacent sequences: A035277 A035278 A035279 this_sequence A035281 A035282 A035283

KEYWORD

nonn

AUTHOR

Erich Friedman (erich.friedman(AT)stetson.edu)

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 September 7 23:08 EDT 2008. Contains 143486 sequences.


AT&T Labs Research