login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022907 The sequence m(n) in A022905. 4
0, 2, 5, 8, 14, 20, 29, 38, 53, 68, 89, 110, 140, 170, 209, 248, 302, 356, 425, 494, 584, 674, 785, 896, 1037, 1178, 1349, 1520, 1730, 1940, 2189, 2438, 2741, 3044, 3401, 3758, 4184, 4610, 5105, 5600, 6185, 6770, 7445, 8120, 8906, 9692, 10589 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

J. M. Dover, On two OEIS conjectures, arXiv:1606.08033 [math.CO], 2016.

FORMULA

a(n) = 3 * A033485(n-1) - 1 = (3/2) * A000123(n-1) - 1, n>1. Proved by Jeremy Dover. - Ralf Stephan, Dec 08 2004

CROSSREFS

Sequence in context: A111711 A095348 A215725 * A006918 A274523 A165189

Adjacent sequences:  A022904 A022905 A022906 * A022908 A022909 A022910

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified March 25 21:19 EDT 2017. Contains 284111 sequences.