login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A270808 First differences of A270807, divided by 2. 2
1, 1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 2, 1, 2, 1, 5, 3, 1, 5, 1, 8, 4, 5, 1, 2, 3, 6, 4, 2, 3, 1, 5, 1, 8, 1, 2, 6, 1, 2, 3, 1, 2, 4, 23, 1, 11, 3, 4, 2, 1, 23, 10, 2, 18, 1, 5, 1, 8, 6, 1, 8, 7, 23, 1, 2, 1, 5, 7, 2, 1, 2, 6, 18, 1, 2, 25, 2, 1, 32, 1, 17, 7, 2, 1, 2, 10, 14, 3, 7, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

LINKS

Chai Wah Wu, Table of n, a(n) for n = 0..10000

PROG

(Python)

from __future__ import division

from sympy import primefactors

A270808_list, a = [], 1

for i in range(10001):

b = a//(max(primefactors(a)+[1])) + 1

A270808_list.append(b//2)

a += b # Chai Wah Wu, Apr 06 2016

CROSSREFS

Cf. A270807.

Sequence in context: A324884 A067815 A133780 * A290532 A080237 A136109

Adjacent sequences: A270805 A270806 A270807 * A270809 A270810 A270811

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Apr 05 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 9 14:35 EST 2022. Contains 358700 sequences. (Running on oeis4.)