MathDB
palindromic partitionings of 2006

Source: Tuymaada Junior 2006 p6

May 12, 2019
number theorycombinatoricsSum

Problem Statement

Palindromic partitioning of the natural number A A is called, when A A is written as the sum of natural the terms A=a1+a2+ ldots+an1+an A = a_1 + a_2 + \ ldots + a_ {n-1} + a_n (n1 n \geq 1 ), in which a1=an,a2=an1 a_1 = a_n , a_2 = a_ {n-1} and in general, ai=an+1i a_i = a_ {n + 1 - i} with 1in 1 \leq i \leq n . For example, 16=16 16 = 16 , 16=2+12+2 16 = 2 + 12 + 2 and 16=7+1+1+7 16 = 7 + 1 + 1 + 7 are palindromic partitions of the number 1616. Find the number of all palindromic partitions of the number 20062006.