Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001670
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001670 n appears n times (n even). +0
2
2, 2, 4, 4, 4, 4, 6, 6, 6, 6, 6, 6, 8, 8, 8, 8, 8, 8, 8, 8, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 16, 16, 16 (list; graph; listen)
OFFSET

2,1

FORMULA

a(n) = 2*floor( 1/2 + sqrt(n-1)). - Antonio Esposito (antonio.b.esposito(AT)italtel.it), Jan 21 2002

With a different offset: g.f. = Sum(i=0, inf, 2*x^(i^2+i)/(1-x)). - Ralf Stephan (ralf(AT)ark.in-berlin.de), Mar 11 2003

CROSSREFS

Cf. A001650, A000194.

Sequence in context: A083551 A080374 A035683 this_sequence A100144 A076222 A098667

Adjacent sequences: A001667 A001668 A001669 this_sequence A001671 A001672 A001673

KEYWORD

nonn,easy

AUTHOR

njas

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 3 01:16 EST 2008. Contains 151161 sequences.


AT&T Labs Research