A new sequence

devarajkandadai · 2007-08-25, 12:14

A 132469 (OEIS) is a new sequence.
A.K.Devaraj

Jens K Andersen · 2007-08-25, 15:23

A132469(n) = (2^(5n)-1)/31 = (32^n-1)/31 = base 32 generalized repunits.

sweety439 · 2020-12-01, 21:23

Quote:

Originally Posted by Jens K Andersen

A132469(n) = (2^(5n)-1)/31 = (32^n-1)/31 = base 32 generalized repunits.

There are no primes in this sequence, since 32^n-1 = (2^n-1) * (16^n+8^n+4^n+2^n+1), and since the two factors are both >31 for n>5 ((32^n-1)/31 is not prime for all 1<=n<=5), thus the factorization is not trivial.

VBCurtis · 2020-12-01, 22:08

You're only 13 years late, and not even on-topic.

https://en.wikipedia.org/wiki/Intern...m#Necroposting

2007-08-25, 12:14	#1
devarajkandadai May 2004 316₁₀ Posts	A new sequence A 132469 (OEIS) is a new sequence. A.K.Devaraj

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Reserved for MF - Sequence 276	kar_bon	Aliquot Sequences	127	2020-12-17 10:05
Primes in n-fibonacci sequence and n-step fibonacci sequence	sweety439	And now for something completely different	17	2017-06-13 03:49
A New Sequence	devarajkandadai	Math	3	2007-03-20 19:43
Sequence	Citrix	Puzzles	5	2005-09-14 23:33
sequence	biwema	Puzzles	13	2004-06-11 02:05

2007-08-25, 15:23	#2
Jens K Andersen Feb 2006 Denmark 2×5×23 Posts	A132469(n) = (2^(5n)-1)/31 = (32^n-1)/31 = base 32 generalized repunits.

2020-12-01, 22:08	#4
VBCurtis "Curtis" Feb 2005 Riverside, CA 1001000001101₂ Posts	You're only 13 years late, and not even on-topic. https://en.wikipedia.org/wiki/Intern...m#Necroposting