SEQ for what

[zak seidov]

"...sit down and try to make up new sequences" (Neil)

I suggest sequence loosely related to 

A006307 Number of ways writing 2^n as unordered sums
of 2 primes.

2^n as a sum of two closest primes:

2^2=4=2+2
2^3=8=3+5
2^4=16=5+11
2^5=32=13+19
2^6=64=23+41
2^7=128=61+67
2^8=256=107+149, etc

this gives one SEQ 
2,3,5,13,23,61,107 (A1, not in OEIS:
a smaller prime in pair of closest primes sum of which
is 2^n;
offset = 2)

for large values of n 
entries are extremely large, e,g., a(201)=
803469022129495137770981046170581301261101496891396417647343,
that is 
2^201=
1606938044258990275541962092341162602522202993782792835297281+
1606938044258990275541962092341162602522202993782792835305471

2^201=(2^200-4095)+(2^200+4095)

and it's better to present them in the form 

or in general case

2^n = (2^(n-1)-a)+(2^(n-1)+a)


 






		
__________________________________________ 
Yahoo! DSL – Something to write home about. 
Just $16.99/mo. or less. 
dsl.yahoo.com