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!)
A268710 Number of iterations of A268395 needed to reach zero from 2^n + 1: a(n) = A268708(2^n + 1). 4
1, 2, 3, 4, 6, 9, 15, 25, 41, 75, 134, 246, 428, 802, 1454, 2643, 4588, 8851, 16849, 32368, 60504, 117343 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..21.

FORMULA

a(n) = A268708((2^n)+1).

PROG

(Scheme) (define (A268710 n) (A268708 (+ 1 (A000079 n))))

CROSSREFS

Cf. A000051, A268395, A268708, A268709.

Sequence in context: A022161 A287148 A127604 * A223900 A326020 A192267

Adjacent sequences:  A268707 A268708 A268709 * A268711 A268712 A268713

KEYWORD

nonn,more

AUTHOR

Antti Karttunen, Feb 11 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 25 01:46 EST 2020. Contains 331229 sequences. (Running on oeis4.)