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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A256994 a(n) = n + 1 when n <= 3, otherwise a(n) = 2^(n-2) + 3; also iterates of A005187 starting from a(1) = 2. 5

%I #16 May 14 2019 16:29:23

%S 2,3,4,7,11,19,35,67,131,259,515,1027,2051,4099,8195,16387,32771,

%T 65539,131075,262147,524291,1048579,2097155,4194307,8388611,16777219,

%U 33554435,67108867,134217731,268435459,536870915,1073741827,2147483651,4294967299,8589934595,17179869187,34359738371,68719476739,137438953475,274877906947

%N a(n) = n + 1 when n <= 3, otherwise a(n) = 2^(n-2) + 3; also iterates of A005187 starting from a(1) = 2.

%C Note that if we instead iterated function b(n) = 1+A005187(n), from b(1) onward, we would get the powers of two, A000079.

%H Antti Karttunen, <a href="/A256994/b256994.txt">Table of n, a(n) for n = 1..128</a>

%F If n < 4, a(n) = n + 1, otherwise a(n) = 2^(n-2) + 3 = A062709(n-2).

%F a(1) = 2; for n > 1, a(n) = A005187(a(n-1)).

%t Table[If[n<4,n+1,2^(n-2)+3],{n,40}] (* _Harvey P. Dale_, May 14 2019 *)

%o (PARI)

%o A256994(n) = if(n < 4, n+1, 2^(n-2) + 3);

%o \\ Alternatively, by iterating A005187:

%o A005187(n) = { my(s=n); while(n>>=1, s+=n); s; };

%o i=1; k=2; print1(k); while(i <= 40, k = A005187(k); print1(", ", k); i++);

%o (Scheme, two alternatives)

%o (define (A256994 n) (if (< n 4) (+ n 1) (+ (A000079 (- n 2)) 3)))

%o ;; The following uses memoization-macro definec:

%o (definec (A256994 n) (if (= 1 n) 2 (A005187 (A256994 (- n 1)))))

%Y Topmost row of A256995, leftmost column of A256997.

%Y Cf. A000079, A005187, A062709, A068156.

%K nonn

%O 1,1

%A _Antti Karttunen_, Apr 15 2015

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 March 28 08:02 EDT 2024. Contains 371236 sequences. (Running on oeis4.)