Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055057
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055057 Largest k value that admits an (n,k) smooth magic carpet. +0
1
3, 3, 8, 14, 15 (list; graph; listen)
OFFSET

5,1

LINKS

E. Friedman and M. Keith, Magic Carpets, J. Int Sequences, 3 (2000), #P.00.2.5.

CROSSREFS

Sequence in context: A090597 A126073 A126592 this_sequence A104864 A059197 A049974

Adjacent sequences: A055054 A055055 A055056 this_sequence A055058 A055059 A055060

KEYWORD

nonn

AUTHOR

Mike Keith (Domnei(AT)aol.com), Jun 02 2000

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research