Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118656
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118656 If C represents the minimum number of segments required to construct n unit cubes, then this sequence represents the number of additional segments required to construct n+1 unit cubes. First differences of sequence A117227. +0
1
12, 8, 8, 5, 8, 5, 5, 3, 8, 5, 5, 3, 8, 5, 5, 3, 5, 3, 8, 5, 5, 3, 5, 3, 5, 3, 3 (list; graph; listen)
OFFSET

0,1

EXAMPLE

a(1)=12 because 12 segments are required to construct the first unit cube. a(2)=8 because 8 additional unit segments are required to construct two unit cubes.

CROSSREFS

Cf. A117227.

Sequence in context: A090438 A128108 A071279 this_sequence A094332 A040134 A121961

Adjacent sequences: A118653 A118654 A118655 this_sequence A118657 A118658 A118659

KEYWORD

easy,nonn

AUTHOR

Ronald R. King (rrking(AT)alaskalife.net), May 18 2006

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research