login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060714 a(n) = a(n-1) + a(n-1 minus the number of terms of the same parity as n so far). 0
1, 2, 3, 5, 6, 9, 11, 17, 19, 30, 33, 50, 55, 74, 80, 99, 108, 138, 155, 188, 207, 257, 276, 331, 361, 441, 471, 579, 609, 764, 797, 985, 1018, 1225, 1275, 1551, 1601, 1962, 2017, 2458, 2532, 2973, 3053, 3632, 3731, 4340, 4448, 5057, 5195, 5992 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..50.

EXAMPLE

a(5) = a(4) + a(4 - the number of odd terms so far) = a(4) + a(4-3) = 5 + 1 = 6.

MATHEMATICA

a[ 1 ] = 1; a[ 2 ] = 2; a[ n_ ] := a[ n ] = Block[ {e = 0}, Do[ If[ EvenQ[ a[ k ] ], e++ ], {k, 1, n - 1} ]; If[ EvenQ[ n ], a[ n - 1 ] + a[ n - 1 - e ], a[ n - 1 ] + a[ e ] ] ]; Table[ a[ n ], {n, 1, 15} ]

CROSSREFS

Cf. A006336, A007604.

Sequence in context: A027588 A224956 A131995 * A241819 A227070 A032718

Adjacent sequences:  A060711 A060712 A060713 * A060715 A060716 A060717

KEYWORD

nonn

AUTHOR

Robert G. Wilson v, Apr 21 2001

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 04:49 EDT 2020. Contains 334671 sequences. (Running on oeis4.)